Sciweavers

2957 search results - page 543 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
DEXA
2008
Springer
132views Database» more  DEXA 2008»
13 years 9 months ago
Efficient Updates for Continuous Skyline Computations
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
ESANN
2008
13 years 9 months ago
Learning Inverse Dynamics: a Comparison
While it is well-known that model can enhance the control performance in terms of precision or energy efficiency, the practical application has often been limited by the complexiti...
Duy Nguyen-Tuong, Jan Peters, Matthias Seeger, Ber...
NIPS
2004
13 years 9 months ago
Probabilistic Inference of Alternative Splicing Events in Microarray Data
Alternative splicing (AS) is an important and frequent step in mammalian gene expression that allows a single gene to specify multiple products, and is crucial for the regulation ...
Ofer Shai, Brendan J. Frey, Quaid Morris, Qun Pan,...
UAI
2004
13 years 9 months ago
Recovering Articulated Object Models from 3D Range Data
We address the problem of unsupervised learning of complex articulated object models from 3D range data. We describe an algorithm whose input is a set of meshes corresponding to d...
Dragomir Anguelov, Daphne Koller, Hoi-Cheung Pang,...
NIPS
1998
13 years 9 months ago
Finite-Sample Convergence Rates for Q-Learning and Indirect Algorithms
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
Michael J. Kearns, Satinder P. Singh