Sciweavers

3250 search results - page 287 / 650
» An Algorithm to Solve a Linear Program
Sort
View
CORR
2010
Springer
61views Education» more  CORR 2010»
15 years 6 months ago
A weakly stable algorithm for general Toeplitz systems
We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that RT R is close to AT A. Thus, when the algorithm is used ...
Adam W. Bojanczyk, Richard P. Brent, Frank R. de H...
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
16 years 4 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
ICASSP
2011
IEEE
14 years 10 months ago
Learning and inference algorithms for partially observed structured switching vector autoregressive models
We present learning and inference algorithms for a versatile class of partially observed vector autoregressive (VAR) models for multivariate time-series data. VAR models can captu...
Balakrishnan Varadarajan, Sanjeev Khudanpur
ICASSP
2011
IEEE
14 years 10 months ago
Cosparse analysis modeling - uniqueness and algorithms
In the past decade there has been a great interest in a synthesis-based model for signals, based on sparse and redundant representations. Such a model assumes that the signal of i...
Sangnam Nam, Michael E. Davies, Michael Elad, R&ea...
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 8 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova