Sciweavers

57 search results - page 5 / 12
» Independence and Functional Dependence Relations on Secrets
Sort
View
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 8 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
EUROCRYPT
2001
Springer
14 years 27 days ago
On Perfect and Adaptive Security in Exposure-Resilient Cryptography
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
Yevgeniy Dodis, Amit Sahai, Adam Smith
BMCBI
2007
140views more  BMCBI 2007»
13 years 8 months ago
From genes to functional classes in the study of biological systems
Background: With the popularisation of high-throughput techniques, the need for procedures that help in the biological interpretation of results has increased enormously. Recently...
Fátima Al-Shahrour, Leonardo Arbiza, Hern&a...
AAAI
1993
13 years 9 months ago
Numeric Reasoning with Relative Orders of Magnitude
In [Dague, 1993], a formal system ROM(K) involving four relations has been defined to reason with relative orders of magnitude. In this paper, problems of introducing quantitative...
Philippe Dague
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 9 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy