3049 search results - page 444 / 610 » On the Convergence of Bound Optimization Algorithms |
133
click to vote
NIPS
2003
15 years 5 months ago
2003
Optimal solutions to Markov Decision Problems (MDPs) are very sensitive with respect to the state transition probabilities. In many practical problems, the estimation of those pro...
125
click to vote
ECAI
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this paper we formulate a novel Divide-andCoordinate (DaC) algorithm, the so-called Egalitarian Utilities Divide-and-Coordinate (EU-DaC) algorithm. The Divide-andCoord...
118
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
151
click to vote
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
— Recently, a maximum likelihood (ML) detection rule for differential unitary space time modulation (DUSTM) under the existence of unknown carrier frequency offset (CFO) has been...
144
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...