Sciweavers

6045 search results - page 946 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
NIPS
2001
15 years 8 months ago
Multiagent Planning with Factored MDPs
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
Carlos Guestrin, Daphne Koller, Ronald Parr
AAAI
1996
15 years 8 months ago
A Connectionist Framework for Reasoning: Reasoning with Examples
We present a connectionist architecture that supports almost instantaneous deductive and abductive reasoning. The deduction algorithm responds in few steps for single rule queries...
Dan Roth
3DPH
2009
128views Healthcare» more  3DPH 2009»
15 years 7 months ago
Predicting Missing Markers in Real-Time Optical Motion Capture
Abstract. A common problem in optical motion capture of human-body movement is the so-called missing marker problem. The occlusion of markers can lead to significant problems in tr...
Tommaso Piazza, Johan Lundström, Andreas Kunz...
CIMAGING
2009
120views Hardware» more  CIMAGING 2009»
15 years 7 months ago
Dantzig selector homotopy with dynamic measurements
The Dantzig selector is a near ideal estimator for recovery of sparse signals from linear measurements in the presence of noise. It is a convex optimization problem which can be r...
Muhammad Salman Asif, Justin K. Romberg
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 6 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky