Sciweavers

121 search results - page 20 / 25
» Anytime K-Nearest Neighbor Search for Database Applications
Sort
View
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 9 months ago
Time series shapelets: a new primitive for data mining
Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm ...
Lexiang Ye, Eamonn J. Keogh
VLDB
1999
ACM
118views Database» more  VLDB 1999»
14 years 25 days ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
PAMI
2011
13 years 3 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
ICRA
2010
IEEE
343views Robotics» more  ICRA 2010»
13 years 7 months ago
Hands in action: real-time 3D reconstruction of hands in interaction with objects
— This paper presents a method for vision based estimation of the pose of human hands in interaction with objects. Despite the fact that most robotics applications of human hand ...
Javier Romero, Hedvig Kjellström, Danica Krag...
KDD
2005
ACM
137views Data Mining» more  KDD 2005»
14 years 9 months ago
Pattern-based similarity search for microarray data
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Haixun Wang, Jian Pei, Philip S. Yu