2342 search results - page 149 / 469 » Sublinear geometric algorithms |
172
click to vote
PAMI
2010
15 years 4 months ago
2010
—In this paper, we introduce a local image descriptor, DAISY, which is very efficient to compute densely. We also present an EM-based algorithm to compute dense depth and occlusi...
159
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
An algorithm for filling-in surface holes is introduced in this paper. The basic idea is to represent the surface of interest in implicit form, and fill-in the holes with a system...
146
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
300
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
168
click to vote
SIGECOM
2006
ACM
16 years 10 days ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...