68 search results - page 4 / 14 » Distributed similarity search in high dimensions using local... |
100
click to vote
SISAP
2008
IEEE
15 years 4 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
DEXA
2006
Springer
14 years 11 months ago
2006
Springer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...
PCM
2001
Springer
15 years 2 months ago
2001
Springer
A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with the database size, is presented. Typical media descrip...
RECOMB
2002
Springer
15 years 10 months ago
2002
Springer
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
175
Voted
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...