3049 search results - page 74 / 610 » On the Convergence of Bound Optimization Algorithms |
122
click to vote
AAECC
2006
Springer
16 years 4 days ago
2006
Springer
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...
166
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper we study statistical properties of the error covariance matrix of a Kalman filter, when it is subject to random measurement losses. We introduce a sequence of tighter...
164
click to vote
IWANN
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. This paper proposes to apply the branch and bound principle from combinatorial optimization to the Dissimilarity Self-Organizing Map (DSOM), a variant of the SOM that can...
179
Voted
ML
2002
ACM
15 years 5 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
165
click to vote
NIPS
2004
15 years 7 months ago
2004
We present a competitive analysis of Bayesian learning algorithms in the online learning setting and show that many simple Bayesian algorithms (such as Gaussian linear regression ...