301 search results - page 32 / 61 » Efficient Sketches for the Set Query Problem |
106
click to vote
LWA
2004
15 years 12 days ago
2004
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
109
click to vote
DMSN
2007
ACM
15 years 3 months ago
2007
ACM
In this paper, we consider a large scale sensor network comprising multiple, say K, base stations and a large number of wireless sensors. Such an infrastructure is expected to be ...
VLDB
2007
ACM
15 years 5 months ago
2007
ACM
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
116
click to vote
DEBS
2008
ACM
15 years 24 days ago
2008
ACM
We introduce a new type of query, called a real-time continuous query (RCQ), that captures the real-time requirements of processing data streams. We develop techniques to efficien...
136
click to vote
STOC
1998
ACM
15 years 3 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...