Sciweavers

602 search results - page 47 / 121
» A New Approximation Method of the Quadratic Discriminant Fun...
Sort
View
INTERSPEECH
2010
14 years 8 months ago
Extractive summarization using a latent variable model
Extractive multi-document summarization is the task of choosing sentences from a set of documents to compose a summary text in response to a user query. We propose a generative ap...
Asli Çelikyilmaz, Dilek Hakkani-Tür
UAI
2008
15 years 3 months ago
Partitioned Linear Programming Approximations for MDPs
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
Branislav Kveton, Milos Hauskrecht
MP
2002
195views more  MP 2002»
15 years 1 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
112
Voted
SIAMJO
2011
14 years 8 months ago
A Unifying Polyhedral Approximation Framework for Convex Optimization
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Dimitri P. Bertsekas, Huizhen Yu
EMNLP
2008
15 years 3 months ago
Transliteration as Constrained Optimization
This paper introduces a new method for identifying named-entity (NE) transliterations in bilingual corpora. Recent works have shown the advantage of discriminative approaches to t...
Dan Goldwasser, Dan Roth