Sciweavers

2850 search results - page 478 / 570
» Answering Queries using Humans, Algorithms and Databases
Sort
View
COMPGEOM
1998
ACM
15 years 6 months ago
Constructing Approximate Shortest Path Maps in Three Dimensions
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
Sariel Har-Peled
IPPS
1997
IEEE
15 years 6 months ago
d-Dimensional Range Search on Multicomputers
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin...
GRAPHITE
2007
ACM
15 years 5 months ago
Visibility map for global illumination in point clouds
Point-sampled geometry has gained significant interest due to their simplicity. The lack of connectivity touted as a plus, however, creates difficulties in many operations like ge...
Rhushabh Goradia, Anil Kanakanti, Sharat Chandran,...
CIKM
2008
Springer
15 years 3 months ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
VLSISP
2010
254views more  VLSISP 2010»
15 years 8 days ago
Manifold Based Local Classifiers: Linear and Nonlinear Approaches
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
Hakan Cevikalp, Diane Larlus, Marian Neamtu, Bill ...