Sciweavers

3820 search results - page 176 / 764
» Bounded Model Debugging
Sort
View
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
15 years 7 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
AAAI
2007
15 years 5 months ago
On the Value of Good Advice: The Complexity of A* Search with Accurate Heuristics
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
Hang T. Dinh, Alexander Russell, Yuan Su
IJSYSC
1998
93views more  IJSYSC 1998»
15 years 2 months ago
A new adaptive control scheme with arbitrary nonlinear inputs
This paper presents a new analysis and design method for model reference adaptive control(MRAC) with arbitrary bounded input nonlinearities. The adaptive algorithm ensures that th...
Wen Yu, Manuel de la Sen
CORR
2011
Springer
148views Education» more  CORR 2011»
14 years 10 months ago
How well can we estimate a sparse vector?
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
Emmanuel J. Candès, Mark A. Davenport
TOG
2008
926views more  TOG 2008»
15 years 3 months ago
3D-modeling by ortho-image generation from image sequences
A semi-automatic approach is presented that enables the generation of a high-quality 3D model of a static object from an image sequence that was taken by a moving, uncalibrated co...
Thorsten Thormählen, Hans-Peter Seidel