Sciweavers

78 search results - page 3 / 16
» Adaptive Methods for Linear Programming Decoding
Sort
View
EOR
2010
149views more  EOR 2010»
14 years 9 months ago
Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
Outer linearization methods for two-stage stochastic linear programs with recourse, such as the L-shaped algorithm, generally apply a single optimality cut on the nonlinear object...
Svyatoslav Trukhanov, Lewis Ntaimo, Andrew Schaefe...
EMNLP
2010
14 years 7 months ago
On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracl...
Alexander M. Rush, David Sontag, Michael Collins, ...
CORR
2006
Springer
127views Education» more  CORR 2006»
14 years 9 months ago
Guessing Facets: Polytope Structure and Improved LP Decoder
Abstract--We investigate the structure of the polytope underlying the linear programming (LP) decoder introduced by Feldman, Karger, and Wainwright. We first show that for expander...
Alexandros G. Dimakis, Martin J. Wainwright
ICASSP
2010
IEEE
14 years 10 months ago
Acoustic model adaptation via Linear Spline Interpolation for robust speech recognition
We recently proposed a new algorithm to perform acoustic model adaptation to noisy environments called Linear Spline Interpolation (LSI). In this method, the nonlinear relationshi...
Michael L. Seltzer, Alex Acero, Kaustubh Kalgaonka...
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
15 years 10 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...