177 search results - page 19 / 36 » Uniform Hashing in Constant Time and Optimal Space |
182
click to vote
SIGMOD
2011
ACM
14 years 8 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...
157
click to vote
ESA
2009
Springer
16 years 17 days 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...
158
click to vote
CORR
2011
Springer
15 years 15 days 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...
155
click to vote
SPAA
2005
ACM
15 years 11 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 ...
156
click to vote
HVEI
2009
15 years 3 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...