Sciweavers

322 search results - page 3 / 65
» On the Complexity of Reverse Similarity Search
Sort
View
EDBT
1998
ACM
131views Database» more  EDBT 1998»
13 years 11 months ago
Processing Complex Similarity Queries with Distance-Based Access Methods
Efficient evaluation of similarity queries is one of the basic requirements for advanced multimedia applications. In this paper, we consider the relevant case where complex similar...
Paolo Ciaccia, Marco Patella, Pavel Zezula
ISAAC
2005
Springer
138views Algorithms» more  ISAAC 2005»
14 years 29 days ago
On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
Zhixiang Chen, Bin Fu
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 7 months ago
Inverting a permutation is as hard as unordered search
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
Ashwin Nayak
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
14 years 7 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
VISUALIZATION
1995
IEEE
13 years 11 months ago
Visualization of Biological Sequence Similarity Search Results
Biological sequence similarity analysis presents visualization challenges, primarily because of the massive amounts of discrete, multi-dimensional data. Genomic data generated by ...
Ed Huai-hsin Chi, Phillip Barry, Elizabeth Shoop, ...