46 search results - page 5 / 10 » Efficient k-NN search on vertically decomposed data |
103
click to vote
NIPS
2004
15 years 1 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
ICCS
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Discovering gene co-regulatory relationships is a new but important research problem in DNA microarray data analysis. The problem of gene specific co-regulation discovery...
ADC
2003
Springer
15 years 5 months ago
2003
Springer
In this paper, we propose a new metric index, called M+ -tree, which is a tree dynamically organized for large datasets in metric spaces. The proposed M+ -tree takes full advantag...
128
click to vote
WEBDB
2010
Springer
14 years 9 months ago
2010
Springer
The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable ...
119
click to vote
COCOON
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...