1024 search results - page 30 / 205 » The Generalized PatchMatch Correspondence Algorithm |
DAM
2008
14 years 9 months ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
SIAMCOMP
2000
14 years 9 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
COMPGEOM
1998
ACM
15 years 2 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
3DIM
1997
IEEE
15 years 2 months ago
1997
IEEE
For registration of 3-D free-form surfaces we have developed a representation which requires no knowledge of the transformation between views. The representation comprises descrip...
AAAI
2007
15 years 2 days ago
2007
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...