1591 search results - page 169 / 319 » Random lifts of graphs |
162
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 (...
284
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 7 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...
163
click to vote
AAAI
1996
15 years 7 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
151
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...