Sciweavers

2168 search results - page 318 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
125
Voted
ALT
2006
Springer
16 years 7 days ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
FSE
2008
Springer
177views Cryptology» more  FSE 2008»
15 years 4 months ago
MD4 is Not One-Way
MD4 is a hash function introduced by Rivest in 1990. It is still used in some contexts, and the most commonly used hash function (MD5, SHA-1, SHA-2) are based on the design princip...
Gaëtan Leurent
JUCS
2006
107views more  JUCS 2006»
15 years 3 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
TSP
2011
170views more  TSP 2011»
14 years 9 months ago
Model Selection for Sinusoids in Noise: Statistical Analysis and a New Penalty Term
—Detection of the number of sinusoids embedded in noise is a fundamental problem in statistical signal processing. Most parametric methods minimize the sum of a data fit (likeli...
Boaz Nadler, Leonid Kontorovich
120
Voted
IACR
2011
94views more  IACR 2011»
14 years 2 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...