Sciweavers

6045 search results - page 337 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
206
Voted
FOSSACS
2010
Springer
15 years 10 months ago
Linearly-Used Continuations in the Enriched Effect Calculus
Abstract. The enriched effect calculus is an extension of Moggi's computational metalanguage with a selection of primitives from linear logic. In this paper, we present an ext...
Jeff Egger, Rasmus Ejlers Møgelberg, Alex S...
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 7 months ago
Separable convex optimization problems with linear ascending constraints
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
Arun Padakandla, Rajesh Sundaresan
206
Voted
MP
2006
110views more  MP 2006»
15 years 7 months ago
Decomposition and Dynamic Cut Generation in Integer Linear Programming
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
Ted K. Ralphs, Matthew V. Galati
212
Voted
TASLP
2008
120views more  TASLP 2008»
15 years 7 months ago
Rapid Speaker Adaptation Using Clustered Maximum-Likelihood Linear Basis With Sparse Training Data
Abstract-- Speaker space based adaptation methods for automatic speech recognition have been shown to provide significant performance improvements for tasks where only a few second...
Yun Tang, Richard Rose
TPDS
2008
97views more  TPDS 2008»
15 years 7 months ago
Solving Systems of Linear Equations on the CELL Processor Using Cholesky Factorization
: The STI CELL processor introduces pioneering solutions in processor architecture. At the same time it presents new challenges for the development of numerical algorithms. One is ...
Jakub Kurzak, Alfredo Buttari, Jack Dongarra