1673 search results - page 171 / 335 » Taming the Dynamics of Distributed Data |
169
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
213
click to vote
ICS
2009
Tsinghua U.
15 years 4 months ago
2009
Tsinghua U.
Data de-duplication has become a commodity component in dataintensive systems and it is required that these systems provide high reliability comparable to others. Unfortunately, b...
280
click to vote
SIGMOD
2009
ACM
16 years 6 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...
166
click to vote
EUROSYS
2008
ACM
16 years 3 months ago
2008
ACM
Programs written in type-unsafe languages such as C and C++ incur costly memory errors that result in corrupted data structures, program crashes, and incorrect results. We present...
162
click to vote
MDM
2009
Springer
16 years 29 days ago
2009
Springer
—This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm. Our objectives are to explore a given geographic region by detecting spatio-temporal ev...