Sciweavers

257 search results - page 24 / 52
» The convexity spectra of graphs
Sort
View
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
CCCG
2008
13 years 9 months ago
A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
Yurai Núñez Rodríguez, Henry ...
JGT
2008
107views more  JGT 2008»
13 years 7 months ago
On planar intersection graphs with forbidden subgraphs
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
János Pach, Micha Sharir
NIPS
2004
13 years 9 months ago
Distributed Information Regularization on Graphs
We provide a principle for semi-supervised learning based on optimizing the rate of communicating labels for unlabeled points with side information. The side information is expres...
Adrian Corduneanu, Tommi Jaakkola
SIAMJO
2010
79views more  SIAMJO 2010»
13 years 6 months ago
Theta Bodies for Polynomial Ideals
Inspired by a question of Lov´asz, we introduce a hierarchy of nested semidefinite relaxations of the convex hull of real solutions to an arbitrary polynomial ideal, called theta...
João Gouveia, Pablo A. Parrilo, Rekha R. Th...