Sciweavers

14 search results - page 3 / 3
» K-Nearest Neighbor Finding Using MaxNearestDist
Sort
View
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
16 years 16 days ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
ICMLC
2010
Springer
14 years 10 months ago
A comparative study on two large-scale hierarchical text classification tasks' solutions
: Patent classification is a large scale hierarchical text classification (LSHTC) task. Though comprehensive comparisons, either learning algorithms or feature selection strategies...
Jian Zhang, Hai Zhao, Bao-Liang Lu
103
Voted
ICIP
2004
IEEE
16 years 1 months ago
Estimating the quality of face localization for face verification
Face localization is the process of finding the exact position of a face in a given image. This can be useful in several applications such as face tracking or person authenticatio...
Yann Rodriguez, Fabien Cardinaux, Samy Bengio, Joh...
SIGMOD
2008
ACM
124views Database» more  SIGMOD 2008»
15 years 7 days ago
Scalable network distance browsing in spatial databases
An algorithm is presented for finding the k nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shorte...
Hanan Samet, Jagan Sankaranarayanan, Houman Alborz...