709 search results - page 79 / 142 » Efficient Evaluation of All-Nearest-Neighbor Queries |
274
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
The modeling of high level semantic events from low level sensor signals is important in order to understand distributed phenomena. For such content-modeling purposes, transformat...
253
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
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...
160
click to vote
SIGMOD
1997
ACM
15 years 10 months ago
1997
ACM
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
193
click to vote
KDD
1999
ACM
15 years 10 months ago
1999
ACM
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
278
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Linear optimization queries retrieve the top-K tuples in a sliding window of a data stream that maximize/minimize the linearly weighted sums of certain attribute values. To effici...