149 search results - page 19 / 30 » Uniform hashing in constant time and linear space |
ICA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. In this work, we present a direction-of-arrival (DOA) estimation method for narrowband sources impinging from the far-field on a uniform linear array (ULA) of sensors, ba...
COMPGEOM
1995
ACM
14 years 5 days ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
AAAI
1996
13 years 10 months ago
1996
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...
MST
2010
13 years 3 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...