208 search results - page 11 / 42 » Variationally universal hashing |
FSE
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
APAL
2002
14 years 9 months ago
2002
A notion called Herbrand saturation is shown to provide the modeltheoretic analogue of a proof-theoretic method, Herbrand analysis, yielding uniform model-theoretic proofs of a nu...
60
Voted
VLDB
1994
ACM
15 years 1 months ago
1994
ACM
In order to maximize systemperformancein environments with fluctuating memory contention, memory-intensive algorithms such as hash join must gracefully adapt to variations in avai...
193
click to vote
ICDE
2012
IEEE
13 years 2 days ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
FUIN
2002
14 years 9 months ago
2002
This paper presents a new model of computation that differs from prior models in that it emphasizes data over flow control, has no named variables and has an object-oriented flavo...