7978 search results - page 1493 / 1596 » Combining shared-coin algorithms |
164
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
176
click to vote
SIGMOD
2009
ACM
15 years 10 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...
169
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...
152
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
179
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...