1091 search results - page 186 / 219 » Approximation Algorithms for Data Placement Problems |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
ECCV
2006
Springer
14 years 10 months ago
2006
Springer
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
SGP
2007
13 years 10 months ago
2007
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications wher...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. A materialized view is a certain synopsis structure precomputed from one or more data sets (called base tables) in order to facilitate various queries on the data. When t...
ECCV
2002
Springer
14 years 10 months ago
2002
Springer
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...