Sciweavers

412 search results - page 35 / 83
» Algorithmic Complexity Bounds on Future Prediction Errors
Sort
View
IJCAI
2003
15 years 1 months ago
Consistent, Convergent, and Constant-Time SLAM
This paper presents a new efficient algorithm for simultaneous localization and mapping (SLAM), using multiple overlapping submaps, each built with respect to a local frame of re...
John J. Leonard, Paul M. Newman
JMLR
2008
117views more  JMLR 2008»
14 years 11 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
BMCBI
2011
14 years 6 months ago
Multithreaded comparative RNA secondary structure prediction using stochastic context-free grammars
Background: The prediction of the structure of large RNAs remains a particular challenge in bioinformatics, due to the computational complexity and low levels of accuracy of state...
Zsuzsanna Sukosd, Bjarne Knudsen, Morten Vaerum, J...
MST
2007
167views more  MST 2007»
14 years 11 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
DMIN
2008
190views Data Mining» more  DMIN 2008»
15 years 1 months ago
Optimization of Self-Organizing Maps Ensemble in Prediction
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
Elie Prudhomme, Stéphane Lallich