237 search results - page 23 / 48 » Methods for Achieving Fast Query Times in Point Location Dat... |
PIMRC
2008
IEEE
14 years 2 months ago
2008
IEEE
Orthogonal frequency division multiplexing (OFDM) system suffers extra performance degradation in fast fading channel due to intercarrier interference (ICI). Combing frequency dom...
TOG
2008
13 years 7 months ago
2008
We introduce 4PCS, a fast and robust alignment scheme for 3D point sets that uses wide bases, which are known to be resilient to noise and outliers. The algorithm allows registeri...
IPPS
1997
IEEE
14 years 3 days ago
1997
IEEE
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...