2079 search results - page 210 / 416 » Universality of random graphs |
202
click to vote
SIGSOFT
2003
ACM
15 years 12 months ago
2003
ACM
Most applications developed today rely on a given middleware platform which governs the interaction between components, the access to resources, etc. To decide, which platform is ...
163
click to vote
ECCV
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. A novel method is proposed for performing multi-label, semi-automated image segmentation. Given a small number of pixels with user-defined labels, one can analytically (...
285
click to vote
DAGM
2006
Springer
15 years 10 months ago
2006
Springer
We present a new approach to integrated motion estimation and segmentation by combining methods from discrete and continuous optimization. The velocity of each of a set of regions ...
198
click to vote
NIPS
2004
15 years 8 months ago
2004
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
169
click to vote
COCOA
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...