467 search results - page 5 / 94 » Processing top k queries from samples |
SIGMOD
2003
ACM
14 years 9 months ago
2003
ACM
In decision support applications, the ability to provide fast approximate answers to aggregation queries is desirable. One commonly-used technique for approximate query answering ...
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
ADC
2009
Springer
14 years 1 months ago
2009
Springer
Efficient XML filtering has been a fundamental technique in recent Web service and XML publish/subscribe applications. In this paper, we consider the problem of filtering a contin...
CVPR
2006
IEEE
14 years 3 months ago
2006
IEEE
We present an algorithm for jointly learning a consistent bidirectional generative-recognition model that combines top-down and bottom-up processing for monocular 3d human motion ...