Results 1  10
of
2,043
Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
, 2004
"... Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear m ..."
Abstract

Cited by 1513 (20 self)
 Add to MetaCart
measurements do we need to recover objects from this class to within accuracy ɛ? This paper shows that if the objects of interest are sparse or compressible in the sense that the reordered entries of a signal f ∈ F decay like a powerlaw (or if the coefficient sequence of f in a fixed basis decays like a power
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning under uncertainty, sensorbased planning, visibility, decisiontheoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.
Pseudorandomness for multilinear readonce algebraic branching programs
 in any order. Electronic Colloquium on Computational Complexity (ECCC
"... We give deterministic blackbox polynomial identity testing algorithms for multilinear readonce oblivious algebraic branching programs (ROABPs), in nO(lg 2 n) time.1 Further, our algorithm is oblivious to the order of the variables. This is the first subexponential time algorithm for this model. F ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We give deterministic blackbox polynomial identity testing algorithms for multilinear readonce oblivious algebraic branching programs (ROABPs), in nO(lg 2 n) time.1 Further, our algorithm is oblivious to the order of the variables. This is the first subexponential time algorithm for this model
On the Construction of PseudoRandom Permutations: LubyRackoff Revisited
 JOURNAL OF CRYPTOLOGY
, 1997
"... Luby and Rackoff [27] showed a method for constructing a pseudorandom permutation from a pseudorandom function. The method is based on composing four (or three for weakened security) so called Feistel permutations, each of which requires the evaluation of a pseudorandom function. We reduce somewh ..."
Abstract

Cited by 131 (8 self)
 Add to MetaCart
Luby and Rackoff [27] showed a method for constructing a pseudorandom permutation from a pseudorandom function. The method is based on composing four (or three for weakened security) so called Feistel permutations, each of which requires the evaluation of a pseudorandom function. We reduce
Pseudorandom generators in . . .
, 2003
"... We call a pseudorandom generator Gn: {0, 1} n → {0, 1} m hard for a propositional proof system P if P can not efficiently prove the (properly encoded) statement Gn(x1,..., xn) = b for any string b ∈ {0, 1} m. We consider a variety of “combinatorial” pseudorandom generators inspired by the NisanWig ..."
Abstract
 Add to MetaCart
We call a pseudorandom generator Gn: {0, 1} n → {0, 1} m hard for a propositional proof system P if P can not efficiently prove the (properly encoded) statement Gn(x1,..., xn) = b for any string b ∈ {0, 1} m. We consider a variety of “combinatorial” pseudorandom generators inspired by the Nisan
Modern cryptography, probabilistic proofs and pseudorandomness, volume 17 of Algorithms and Combinatorics
, 1999
"... all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that new copies bear this notice and the full citation on the first page. Abstracting with credit is permitted. IIPreface You can start by put ..."
Abstract

Cited by 131 (13 self)
 Add to MetaCart
all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that new copies bear this notice and the full citation on the first page. Abstracting with credit is permitted. IIPreface You can start by putting the do not disturb sign. Cay, in Desert Hearts (1985). The interplay between randomness and computation is one of the most fascinating scientific phenomena uncovered in the last couple of decades. This interplay is at the heart of modern cryptography and plays a fundamental role in complexity theory at large. Specifically, the interplay of randomness and computation is pivotal to several intriguing notions of probabilistic proof systems and is the focal of the computational approach to randomness. This book provides an introduction to these three, somewhat interwoven domains (i.e., cryptography, proofs and randomness). Modern Cryptography. Whereas classical cryptography was confined to
Aggregate Pseudorandom Functions and Connections to Learning
"... In the first part of this work, we introduce a new type of pseudorandom function for which “aggregate queries ” over exponentialsized sets can be efficiently answered. We show how to use algebraic properties of underlying classical pseudo random functions, to construct such “aggregate pseudorand ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In the first part of this work, we introduce a new type of pseudorandom function for which “aggregate queries ” over exponentialsized sets can be efficiently answered. We show how to use algebraic properties of underlying classical pseudo random functions, to construct such “aggregate pseudorandom
RelatedKey Security for Pseudorandom Functions Beyond the Linear Barrier
"... Relatedkey attacks (RKAs) concern the security of cryptographic primitives in the situation where the key can be manipulated by the adversary. In the RKA setting, the adversary’s power is expressed through the class of relatedkey deriving (RKD) functions which the adversary is restricted to using ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
stricted to using when modifying keys. Bellare and Kohno (Eurocrypt 2003) first formalised RKAs and pinpointed the foundational problem of constructing RKAsecure pseudorandom functions (RKAPRFs). To date there are few constructions for RKAPRFs under standard assumptions, and it is a major open problem
Results 1  10
of
2,043