Sciweavers

133 search results - page 25 / 27
» Approximate Nearest Subspace Search
Sort
View
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
14 years 2 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
TKDE
2011
332views more  TKDE 2011»
13 years 3 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
14 years 8 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng
IROS
2008
IEEE
230views Robotics» more  IROS 2008»
14 years 3 months ago
Visual recognition of grasps for human-to-robot mapping
— This paper presents a vision based method for grasp classification. It is developed as part of a Programming by Demonstration (PbD) system for which recognition of objects and...
Hedvig Kjellström, Javier Romero, Danica Krag...
ISMIR
2001
Springer
146views Music» more  ISMIR 2001»
14 years 1 months ago
An Audio Front End for Query-by-Humming Systems
In this paper, the problem of processing audio signals is addressed in the context of query-by-humming systems. Since singing is naturally used as input, we aim to develop a front...
Emanuele Pollastri