Sciweavers

478 search results - page 17 / 96
» Improving probability bounds by optimization over subsets
Sort
View
ESA
2009
Springer
143views Algorithms» more  ESA 2009»
14 years 2 months ago
On Optimally Partitioning a Text to Improve Its Compression
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
Paolo Ferragina, Igor Nitto, Rossano Venturini
DCC
2010
IEEE
13 years 11 months ago
Causal Transmission of Colored Source Frames over a Packet Erasure Channel
We propose a linear predictive quantization system for causally transmitting parallel sources with temporal memory (colored frames) over an erasure channel. By optimizing within t...
Ying-zong Huang, Yuval Kochman, Gregory W. Wornell
UAI
2003
13 years 9 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
DEDS
2010
157views more  DEDS 2010»
13 years 4 months ago
On-line Optimal Control of a Class of Discrete Event Systems with Real-Time Constraints
We consider Discrete Event Systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task mee...
Jianfeng Mao, Christos G. Cassandras
JMLR
2006
92views more  JMLR 2006»
13 years 7 months ago
Linear Programs for Hypotheses Selection in Probabilistic Inference Models
We consider an optimization problem in probabilistic inference: Given n hypotheses Hj, m possible observations Ok, their conditional probabilities pk j, and a particular Ok, selec...
Anders Bergkvist, Peter Damaschke, Marcel Lüt...