Sciweavers

412 search results - page 14 / 83
» Algorithmic Complexity Bounds on Future Prediction Errors
Sort
View
UAI
1998
15 years 1 months ago
Tractable Inference for Complex Stochastic Processes
The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system,...
Xavier Boyen, Daphne Koller
DAGSTUHL
2004
15 years 1 months ago
On the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
Knut Petras, Klaus Ritter
JC
2000
45views more  JC 2000»
14 years 11 months ago
What Is the Complexity of Stieltjes Integration?
We study the complexity of approximating the Stieltjes integral R 1 0 f(x)dg(x) for functions f having r continuous derivatives and functions g whose sth derivative has bounded va...
Arthur G. Werschulz
ICRA
2006
IEEE
136views Robotics» more  ICRA 2006»
15 years 5 months ago
Predictive Control Algorithms using Biological Signals for Active Relative Motion Canceling in Robotic Assisted Heart Surgery
— Robotics technology promises an enhanced way of performing off-pump coronary artery bypass graft (CABG) surgery. In the robotic-assisted CABG surgery, surgeon performs the oper...
Ozkan Bebek, Murat Cenk Cavusoglu
NIPS
2008
15 years 1 months ago
Theory of matching pursuit
We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a sample compression scheme. We show that this bound...
Zakria Hussain, John Shawe-Taylor