Sciweavers

1404 search results - page 205 / 281
» Optimization problems in multiple-interval graphs
Sort
View
LION
2007
Springer
138views Optimization» more  LION 2007»
16 years 10 days ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
ICML
2007
IEEE
16 years 7 months ago
Regression on manifolds using kernel dimension reduction
We study the problem of discovering a manifold that best preserves information relevant to a nonlinear regression. Solving this problem involves extending and uniting two threads ...
Jens Nilsson, Fei Sha, Michael I. Jordan
IPSN
2009
Springer
16 years 29 days ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
ISCIS
2009
Springer
16 years 22 days ago
Construction of examination timetables based on ordering heuristics
—In this paper, we combine graph coloring heuristics, namely largest degree and saturation degree with the concept of a heuristic modifier under the framework of squeaky wheel op...
Syariza Abdul Rahman, Andrzej Bargiela, Edmund K. ...
PKDD
2009
Springer
117views Data Mining» more  PKDD 2009»
16 years 22 days ago
New Regularized Algorithms for Transductive Learning
Abstract. We propose a new graph-based label propagation algorithm for transductive learning. Each example is associated with a vertex in an undirected graph and a weighted edge be...
Partha Pratim Talukdar, Koby Crammer