ALENEX 2001 Workshop on Algorithm Engineering and Experimentation
 |  |
Wall of Fame | Most Viewed ALENEX-2001 Paper
ALENEX
2001
14 years 25 days ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 215 | ||
| 2 | | 151 | ||
| 3 | | 105 | ||
| 4 | | 103 | ||
| 5 | | 101 | ||
| 6 | | 89 |