1262 search results - page 21 / 253 » Fast Robust Hashing |
74
Voted
ICMCS
2005
IEEE
15 years 3 months ago
2005
IEEE
A common way of resisting protocol attacks is to employ cryptographic techniques so that provable security can be retained. However, some desired requirements of watermarking such...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
SPIRE
2005
Springer
15 years 2 months ago
2005
Springer
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
AAAI
2012
12 years 12 months ago
2012
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
88
Voted
FMCAD
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...