149 search results - page 16 / 30 » Uniform hashing in constant time and linear space |
PVLDB
2010
13 years 7 months ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
SODA
2000
ACM
13 years 10 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...
FOCS
2004
IEEE
14 years 10 days ago
2004
IEEE
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
CGF
2008
13 years 8 months ago
2008
The focus of research in acceleration structures for ray tracing recently shifted from render time to time to image, the sum of build time and render time, and also the memory foo...