Sciweavers

331 search results - page 10 / 67
» A Clustering Algorithm Based Absorbing Nearest Neighbors
Sort
View
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
14 years 7 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
14 years 7 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
ICC
2008
IEEE
176views Communications» more  ICC 2008»
14 years 2 months ago
A k-Nearest Neighbor Approach for User Authentication through Biometric Keystroke Dynamics
— Keystroke dynamics exhibit people’s behavioral features which are similar to hand signatures. A major problem hindering the large scale deployment of this technology is its h...
Jiankun Hu, Don Gingrich, Andy Sentosa
ICASSP
2010
IEEE
13 years 7 months ago
Optimized intrinsic dimension estimator using nearest neighbor graphs
We develop an approach to intrinsic dimension estimation based on k-nearest neighbor (kNN) distances. The dimension estimator is derived using a general theory on functionals of k...
Kumar Sricharan, Raviv Raich, Alfred O. Hero III
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 8 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson