Sciweavers

7921 search results - page 169 / 1585
» LSH-preserving functions and their applications
Sort
View
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
16 years 7 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...
LOPSTR
2005
Springer
15 years 12 months ago
Declarative Programming with Function Patterns
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
Sergio Antoy, Michael Hanus
ICCAD
2007
IEEE
102views Hardware» more  ICCAD 2007»
16 years 3 months ago
Scalable exploration of functional dependency by interpolation and incremental SAT solving
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
Chih-Chun Lee, Jie-Hong Roland Jiang, Chung-Yang H...
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 7 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
ASIACRYPT
2009
Springer
16 years 1 months ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...