Sciweavers

516 search results - page 95 / 104
» Sets of k-Independent Strings
Sort
View
ALT
2008
Springer
14 years 5 months ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
14 years 3 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
CAISE
2007
Springer
14 years 2 months ago
Declarative XML Data Cleaning with XClean
Data cleaning is the process of correcting anomalies in a data source, that may for instance be due to typographical errors, or duplicate representations of an entity. It is a cruc...
Melanie Weis, Ioana Manolescu
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
14 years 2 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
14 years 2 months ago
Universally Composable Security with Global Setup
Abstract. Cryptographic protocols are often designed and analyzed under some trusted set-up assumptions, namely in settings where the participants have access to global information...
Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi W...