Sciweavers

87 search results - page 1 / 18
» Using hashing to solve the dictionary problem
Sort
View
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
11 years 6 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
13 years 5 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
CRYPTO
2006
Springer
124views Cryptology» more  CRYPTO 2006»
13 years 8 months ago
Mitigating Dictionary Attacks on Password-Protected Local Storage
We address the issue of encrypting data in local storage using a key that is derived from the user's password. The typical solution in use today is to derive the key from the...
Ran Canetti, Shai Halevi, Michael Steiner
TALG
2008
124views more  TALG 2008»
13 years 4 months ago
Uniform deterministic dictionaries
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
Milan Ruzic
ACL
2006
13 years 5 months ago
Using Comparable Corpora to Solve Problems Difficult for Human Translators
In this paper we present a tool that uses comparable corpora to find appropriate translation equivalents for expressions that are considered by translators as difficult. For a phr...
Serge Sharoff, Bogdan Babych, Anthony Hartley