Sciweavers

322 search results - page 1 / 65
» On the Complexity of Reverse Similarity Search
Sort
View
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 7 months ago
Reversal Complexity Revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
André Hernich, Nicole Schweikardt
ICDE
2006
IEEE
155views Database» more  ICDE 2006»
14 years 8 months ago
Mining, Indexing, and Similarity Search in Graphs and Complex Structures
Jiawei Han, Xifeng Yan, Philip S. Yu
FQAS
2009
Springer
157views Database» more  FQAS 2009»
14 years 2 months ago
On Fuzzy vs. Metric Similarity Search in Complex Databases
Abstract. The task of similarity search is widely used in various areas of computing, including multimedia databases, data mining, bioinformatics, social networks, etc. For a long ...
Alan Eckhardt, Tomás Skopal, Peter Vojt&aac...
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 7 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...