Sciweavers

297 search results - page 57 / 60
» On the Linear Quadratic Minimum-fuel Problem
Sort
View
ICASSP
2010
IEEE
13 years 6 months ago
A robust minimum volume enclosing simplex algorithm for hyperspectral unmixing
Hyperspectral unmixing is a process of extracting hidden spectral signatures (or endmembers) and the corresponding proportions (or abundances) of a scene, from its hyperspectral o...
Arul-Murugan Ambikapathi, Tsung-Han Chan, Wing-Kin...
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 6 months ago
Is Witsenhausen's counterexample a relevant toy?
This paper answers a question raised by Doyle on the relevance of the Witsenhausen counterexample as a toy decentralized control problem. The question has two sides, the first of w...
Pulkit Grover, Anant Sahai
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 6 months ago
On Polynomial Multiplication in Chebyshev Basis
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
Pascal Giorgi
AUTOMATICA
2006
84views more  AUTOMATICA 2006»
13 years 6 months ago
Optimal control of LTI systems over unreliable communication links
In this paper, optimal control of linear time-invariant (LTI) systems over unreliable communication links is studied. The motivation of the problem comes from growing applications...
Orhan C. Imer, Serdar Yüksel, Tamer Basar
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 6 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
Martin J. Wainwright