Sciweavers

497 search results - page 35 / 100
» Approximating max-min linear programs with local algorithms
Sort
View
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
14 years 10 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
IJCAI
1997
14 years 11 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
PDP
2005
IEEE
15 years 3 months ago
Distributed Local Resolution of Boolean Equation Systems
Boolean Equation Systems (BESs) allow to represent various problems encountered in the area of propositional logic programming and verification of concurrent systems. Several seq...
Christophe Joubert, Radu Mateescu
ICONIP
2008
14 years 11 months ago
The Diversity of Regression Ensembles Combining Bagging and Random Subspace Method
Abstract. The concept of Ensemble Learning has been shown to increase predictive power over single base learners. Given the bias-variancecovariance decomposition, diversity is char...
Alexandra Scherbart, Tim W. Nattkemper
ICARCV
2008
IEEE
170views Robotics» more  ICARCV 2008»
15 years 4 months ago
Mixed state estimation for a linear Gaussian Markov model
— We consider a discrete-time dynamical system with Boolean and continuous states, with the continuous state propagating linearly in the continuous and Boolean state variables, a...
Argyris Zymnis, Stephen P. Boyd, Dimitry M. Gorine...