Sciweavers

713 search results - page 46 / 143
» Dispersing Hash Functions
Sort
View
ICASSP
2008
IEEE
15 years 4 months ago
Query adaptative locality sensitive hashing
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
Herve Jegou, Laurent Amsaleg, Cordelia Schmid, Pat...
ICML
2010
IEEE
14 years 10 months ago
Sequential Projection Learning for Hashing with Compact Codes
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang
FSE
2010
Springer
132views Cryptology» more  FSE 2010»
15 years 2 months ago
Rebound Attack on Reduced-Round Versions of JH
Abstract. JH, designed by Wu, is one of the 14 second round candidates in the NIST Hash Competition. This paper presents the first analysis results of JH by using rebound attack. ...
Vincent Rijmen, Deniz Toz, Kerem Varici
ACNS
2011
Springer
254views Cryptology» more  ACNS 2011»
14 years 1 months ago
Linear Analysis of Reduced-Round CubeHash
Abstract. Recent developments in the field of cryptanalysis of hash functions has inspired NIST to announce a competition for selecting a new cryptographic hash function to join t...
Tomer Ashur, Orr Dunkelman
GECCO
2005
Springer
101views Optimization» more  GECCO 2005»
15 years 3 months ago
Measuring mobility and the performance of global search algorithms
The global search properties of heuristic search algorithms are not well understood. In this paper, we introduce a new metric, mobility, that quantifies the dispersion of local o...
Monte Lunacek, L. Darrell Whitley, James N. Knight