Sciweavers

138 search results - page 24 / 28
» K-Nearest Neighbor Search for Moving Query Point
Sort
View
ICML
2010
IEEE
13 years 9 months ago
Sequential Projection Learning for Hashing with Compact Codes
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
13 years 10 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
COMPGEOM
2010
ACM
14 years 1 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
ISVC
2009
Springer
14 years 3 months ago
Motion-Based View-Invariant Articulated Motion Detection and Pose Estimation Using Sparse Point Features
Abstract. We present an approach for articulated motion detection and pose estimation that uses only motion information. To estimate the pose and viewpoint we introduce a novel mot...
Shrinivas J. Pundlik, Stanley T. Birchfield
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
14 years 2 months ago
Statistical similarity search applied to content-based video copy detection
—Content-based copy detection (CBCD) is one of the emerging multimedia applications for which there is a need of a concerted effort from the database community and the computer ...
Alexis Joly, Olivier Buisson, Carl Frélicot