2498 search results - page 22 / 500 » Data Structures with Unpredictable Timing |
105
click to vote
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...
PLDI
1995
ACM
15 years 1 months ago
1995
ACM
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
WDAS
2000
14 years 11 months ago
2000
This paper reviews literature on scalable data structures for searching in a distributed computing environment. Starting with a system where one server manages a file of a given s...
SIAMCOMP
1998
14 years 9 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
106
click to vote
TALG
2008
14 years 9 months ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...