177 search results - page 21 / 36 » Uniform Hashing in Constant Time and Optimal Space |
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and af...
ISCAS
2005
IEEE
14 years 1 months ago
2005
IEEE
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract--In this two-part paper, we study the design and optimization of limited feedback single-user and multiuser systems with a multiple-antenna base station and single-antenna...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
WADS
1997
Springer
13 years 11 months ago
1997
Springer
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...