177 search results - page 19 / 36 » Uniform Hashing in Constant Time and Optimal Space |
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a multi-core tree-based...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
HVEI
2009
13 years 5 months ago
2009
We present the design of a spherical imaging system with the following properties: (i) A 4 field of view that enables it to "see" in all directions; (ii) a single center...