2157 search results - page 13 / 432 » Optimal Fast Hashing |
137
click to vote
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
Similarity search, namely, finding approximate nearest neighborhoods, is the core of many large scale machine learning or vision applications. Recently, many research results dem...
101
click to vote
VLSISP
2008
15 years 1 months ago
2008
Abstract. In this paper we propose an architecture design methodology to optimize the throughput of MD4-based hash algorithms. The proposed methodology includes an iteration bound ...
DAC
2004
ACM
16 years 2 months ago
2004
ACM
139
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
104
click to vote
CTRSA
2006
Springer
15 years 5 months ago
2006
Springer
Vaudenay recently proposed a message authentication protocol which is interactive and based on short authenticated strings (SAS). We study here SASbased non-interactive message aut...