999 search results - page 147 / 200 » Finding shapes in a set of points |
113
click to vote
Publication
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
ICMCS
1999
IEEE
15 years 2 months ago
1999
IEEE
In accessing large collections of digitized videos, it is often difficult to find both the appropriate video file and the portion of the video that is of interest. This paper descr...
EH
2004
IEEE
15 years 1 months ago
2004
IEEE
This paper describes the optimisation of the word length in a 16-point radix-4 reconfigurable pipelined Fast Fourier Transform (FFT) based receiver device. Two forms of optimisati...
FPL
2004
Springer
15 years 1 months ago
2004
Springer
We describe algorithmic results for two crucial aspects of allocating resources on computational hardware devices with partial reconfigurability. By using methods from the field of...
CCCG
2010
14 years 11 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...