Sciweavers

11 search results - page 1 / 3
» Indexing the Edges - A Simple and Yet Efficient Approach to ...
Sort
View
PODS
2000
ACM
120views Database» more  PODS 2000»
13 years 8 months ago
Indexing the Edges - A Simple and Yet Efficient Approach to High-Dimensional Indexing
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
Beng Chin Ooi, Kian-Lee Tan, Cui Yu, Stépha...
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
14 years 6 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 5 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
ACL
1996
13 years 6 months ago
Noun-Phrase Analysis in Unrestricted Text for Information Retrieval
Information retrieval is an important application area of natural-language processing where one encounters the genuine challenge of processing large quantities of unrestricted nat...
David A. Evans, ChengXiang Zhai
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
13 years 4 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...