5055 search results - page 889 / 1011 » Relative Timing |
121
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
203
click to vote
VLDB
2004
ACM
16 years 2 months ago
2004
ACM
In-network aggregation has been proposed as one method for reducing energy consumption in sensor networks. In this paper, we explore two ideas related to further reducing energy co...
219
Voted
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
193
Voted
VLDB
2008
ACM
16 years 2 months ago
2008
ACM
Large highly distributed data sets are poorly supported by current query technologies. Applications such as endsystembased network management are characterized by data stored on l...
235
click to vote
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...