Sciweavers

1554 search results - page 59 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 3 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
127
Voted
AUTOMATICA
2004
122views more  AUTOMATICA 2004»
15 years 2 months ago
Approximate explicit receding horizon control of constrained nonlinear systems
An algorithm for the construction of an explicit piecewise linear state feedback approximation to nonlinear constrained receding horizon control is given. It allows such controlle...
Tor Arne Johansen
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
14 years 9 months ago
Learning in mean-field oscillator games
This research concerns a noncooperative dynamic game with large number of oscillators. The states are interpreted as the phase angles for a collection of non-homogeneous oscillator...
Huibing Yin, Prashant G. Mehta, Sean P. Meyn, Uday...
115
Voted
GLOBECOM
2007
IEEE
15 years 9 months ago
Low Complexity Soft-Input Soft-Output Block Decision Feedback Equalization
— A low complexity soft-input soft-output (SISO) block decision feedback equalization (BDFE) algorithm is presented for Turbo equalization. Based on minimum mean square error (MM...
Jingxian Wu, Yahong Rosa Zheng
118
Voted
IJFCS
2006
70views more  IJFCS 2006»
15 years 2 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...