Results 1  10
of
1,356,904
Pseudorandom generators for spacebounded computation
 Combinatorica
, 1992
"... Pseudorandom generators are constructed which convert O(SlogR) truly random bits to R bits that appear random to any algorithm that runs in SPACE(S). In particular, any randomized polynomial time algorithm that runs in space S can be simulated using only O(Slogn) random bits. An application of these ..."
Abstract

Cited by 245 (11 self)
 Add to MetaCart
Pseudorandom generators are constructed which convert O(SlogR) truly random bits to R bits that appear random to any algorithm that runs in SPACE(S). In particular, any randomized polynomial time algorithm that runs in space S can be simulated using only O(Slogn) random bits. An application
On Space Bounded Server Algorithms
, 1993
"... This paper studies space bounded algorithms, i.e., algorithms that use a constant amount of scratch space, for the kserver problem. The paper first shows a characterization of the set of space bounded algorithms that are competitive in finite metric spaces. The result yields a method for (1) effec ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper studies space bounded algorithms, i.e., algorithms that use a constant amount of scratch space, for the kserver problem. The paper first shows a characterization of the set of space bounded algorithms that are competitive in finite metric spaces. The result yields a method for (1
SpaceBounded Quantum Complexity
 Journal of Computer and System Sciences
, 1999
"... This paper investigates the computational power of spacebounded quantum Turing machines. The following facts are proved for spaceconstructible space bounds s satisfying s(n) = Ω(log n). 1. Any quantum Turing machine (QTM) running in space s can be simulated by an unbounded error probabilistic Tur ..."
Abstract

Cited by 27 (5 self)
 Add to MetaCart
This paper investigates the computational power of spacebounded quantum Turing machines. The following facts are proved for spaceconstructible space bounds s satisfying s(n) = Ω(log n). 1. Any quantum Turing machine (QTM) running in space s can be simulated by an unbounded error probabilistic
Space Bounds for Resolution
, 1999
"... We introduce a new way to measure the space needed in resolution refutations of CNF formulas in propositional logic. With the former definition [11] the space required for the resolution of any unsatisfiable formula in CNF is linear in the number of clauses. The new definition allows a much finer ..."
Abstract

Cited by 65 (3 self)
 Add to MetaCart
graphs of a formula, and as we show, has relationships to the size of the refutation. We also give upper and lower bounds on the space needed for the resolution of unsatisfiable formulas. We show that Tseitin formulas associated to a certain kind of expander graphs of n nodes need resolution space n
Randomization and Derandomization in SpaceBounded Computation
 In Proceedings of the 11th Annual IEEE Conference on Computational Complexity
, 1996
"... This is a survey of spacebounded probabilistic computation, summarizing the present state of knowledge about the relationships between the various complexity classes associated with such computation. The survey especially emphasizes recent progress in the construction of pseudorandom generators tha ..."
Abstract

Cited by 40 (0 self)
 Add to MetaCart
This is a survey of spacebounded probabilistic computation, summarizing the present state of knowledge about the relationships between the various complexity classes associated with such computation. The survey especially emphasizes recent progress in the construction of pseudorandom generators
SpaceBounded Quantum Computation
, 1998
"... In this dissertation, we investigate the computational power of quantum Turing machines operating in bounded space. First, we consider spacebounds that are spaceconstructible and at least logarithmic in the input size. For such spacebounds, it is shown that quantum Turing machines and probabilist ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
In this dissertation, we investigate the computational power of quantum Turing machines operating in bounded space. First, we consider spacebounds that are spaceconstructible and at least logarithmic in the input size. For such spacebounds, it is shown that quantum Turing machines
A Limited Memory Algorithm for Bound Constrained Optimization
 SIAM Journal on Scientific Computing
, 1994
"... An algorithm for solving large nonlinear optimization problems with simple bounds is described. ..."
Abstract

Cited by 557 (9 self)
 Add to MetaCart
An algorithm for solving large nonlinear optimization problems with simple bounds is described.
Lecture SpaceBounded Derandomization
"... We now discuss derandomization of spacebounded algorithms. Here nontrivial results can be shown without making any unproven assumptions, in contrast to what is currently known for derandomizing timebounded algorithms. We show first that1 BPL ⊆ SPACE(log 2 n) and then improve the analysis and show ..."
Abstract
 Add to MetaCart
We now discuss derandomization of spacebounded algorithms. Here nontrivial results can be shown without making any unproven assumptions, in contrast to what is currently known for derandomizing timebounded algorithms. We show first that1 BPL ⊆ SPACE(log 2 n) and then improve the analysis
Plans And ResourceBounded Practical Reasoning
 COMPUTATIONAL INTELLIGENCE, 4(4):349355, 1988
, 1988
"... An architecture for a rational agent must allow for meansend reasoning, for the weighing of competing alternatives, and for interactions between these two forms of reasoning. Such an architecture must also address the problem of resource boundedness. We sketch a solution of the first problem that p ..."
Abstract

Cited by 485 (19 self)
 Add to MetaCart
that points the way to a solution of the second. In particular, we present a highlevel specification of the practicalreasoning component of an architecture for a resourcebounded rational agent. In this architecture, a major role of the agent's plans is to constrain the amount of further practical
Actions as spacetime shapes
 In ICCV
, 2005
"... Human action in video sequences can be seen as silhouettes of a moving torso and protruding limbs undergoing articulated motion. We regard human actions as threedimensional shapes induced by the silhouettes in the spacetime volume. We adopt a recent approach [14] for analyzing 2D shapes and genera ..."
Abstract

Cited by 642 (4 self)
 Add to MetaCart
Human action in video sequences can be seen as silhouettes of a moving torso and protruding limbs undergoing articulated motion. We regard human actions as threedimensional shapes induced by the silhouettes in the spacetime volume. We adopt a recent approach [14] for analyzing 2D shapes
Results 1  10
of
1,356,904