322 search results - page 23 / 65 » On the Complexity of Reverse Similarity Search |
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
Fast retrieval methods are critical for large-scale and
data-driven vision applications. Recent work has explored
ways to embed high-dimensional features or complex distance
fun...
IACR
2011
12 years 8 months ago
2011
In 2008 I. Dinur and A. Shamir presented a new type of algebraic attack on symmetric ciphers named cube attack. The method has been applied to reduced variants of stream ciphers T...
SSDBM
2000
IEEE
14 years 1 months ago
2000
IEEE
Fast retrieval of time series in terms of their contents is important in many application domains. This paper studies database techniques supporting fast searches for time series ...
RECOMB
2009
Springer
14 years 9 months ago
2009
Springer
Finding similar structures from 3-D structure databases of proteins is becoming more and more important issue in the post-genomic molecular biology. To compare 3-D structures of tw...
CISS
2008
IEEE
14 years 3 months ago
2008
IEEE
— In this paper, we propose a memory-constrained tree search (MCTS) algorithm for the detection in multiple-input multiple-output (MIMO) systems. The MCTS algorithm offers a wide...