1949 search results - page 212 / 390 » Random graphs on surfaces |
257
click to vote
DAGM
2006
Springer
15 years 8 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 ...
170
click to vote
NIPS
2004
15 years 6 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...
137
Voted
AAAI
1996
15 years 6 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...
157
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
140
Voted
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Given an evolutionary optimization problem with many possible genotypes for each phenotype this study investigates if the evolved genes for a given phenotype are more robust to po...