6251 search results - page 205 / 1251 » Randomness, Computability, and Density |
160
click to vote
COMGEO
1999
ACM
15 years 3 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
294
click to vote
CVPR
2011
IEEE
15 years 10 days ago
2011
IEEE
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
157
click to vote
TDSC
2011
14 years 11 months ago
2011
— Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and computation complexitie...
136
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
In this work, we present a common framework for seeded image segmentation algorithms that yields two of the leading methods as special cases - The Graph Cuts and the Random Walker...
138
click to vote
CSR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...