Sciweavers

357 search results - page 46 / 72
» Solving Generalized Maximum Dispersion with Linear Programmi...
Sort
View
SPEECH
2010
154views more  SPEECH 2010»
13 years 3 months ago
Long story short - Global unsupervised models for keyphrase based meeting summarization
act 11 We analyze and compare two different methods for unsupervised extractive spontaneous speech summarization in the meeting 12 domain. Based on utterance comparison, we introdu...
Korbinian Riedhammer, Benoît Favre, Dilek Ha...
CCCG
2009
13 years 10 months ago
Clarkson's Algorithm for Violator Spaces
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
Yves Brise, Bernd Gärtner
ESANN
2004
13 years 10 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
ICCAD
2009
IEEE
133views Hardware» more  ICCAD 2009»
13 years 6 months ago
A parallel preconditioning strategy for efficient transistor-level circuit simulation
A parallel computing approach for large-scale SPICE-accurate circuit simulation is described that is based on a new preconditioned iterative solver. The preconditioner involves the...
Heidi Thornquist, Eric R. Keiter, Robert J. Hoekst...
ECAI
2010
Springer
13 years 10 months ago
On Finding Compromise Solutions in Multiobjective Markov Decision Processes
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
Patrice Perny, Paul Weng