144 search results - page 11 / 29 » Query dependent ranking using K-nearest neighbor |
KDD
2005
ACM
14 years 8 months ago
2005
ACM
Abstract. With the amount of available information on the Web growing rapidly with each day, the need to automatically filter the information in order to ensure greater user effici...
VLDB
2004
ACM
14 years 28 days ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
SIGMOD
2008
ACM
13 years 7 months ago
2008
ACM
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...
ICMLC
2010
Springer
13 years 5 months ago
2010
Springer
: Patent classification is a large scale hierarchical text classification (LSHTC) task. Though comprehensive comparisons, either learning algorithms or feature selection strategies...
JGTOOLS
2006
13 years 7 months ago
2006
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...