350 search results - page 44 / 70 » Lower bounds and heuristic algorithms for the k |
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper presents an algorithm, called the winnerupdate algorithm, for accelerating the nearest neighbor search. By constructing a hierarchical structure ,for each feature point...
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
FCT
2005
Springer
15 years 3 months ago
2005
Springer
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
TIT
1998
14 years 9 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...