Sciweavers

400 search results - page 42 / 80
» Approximation Stability and Boosting
Sort
View
AUTOMATICA
2007
129views more  AUTOMATICA 2007»
13 years 8 months ago
Robust control of polytopic systems by convex optimization
— Robust control synthesis of linear time-invariant SISO polytopic systems is investigated using the polynomial approach. A convex set of all stabilizing controllers for a polyto...
Alireza Karimi, Hamid Khatibi, Roland Longchamp
CORR
2006
Springer
128views Education» more  CORR 2006»
13 years 8 months ago
The Shannon capacity of a graph and the independence numbers of its powers
The independence numbers of powers of graphs have been long studied, under several definitions of graph products, and in particular, under the strong graph product. We show that t...
Noga Alon, Eyal Lubetzky
IOR
2010
92views more  IOR 2010»
13 years 6 months ago
Series Expansions for Continuous-Time Markov Processes
We present exchange formulas that allow to express the stationary distribution of a continuous Markov chain with denumerable state-space having generator matrix Q∗ through a con...
Bernd Heidergott, Arie Hordijk, Nicole Leder
MOC
2010
13 years 2 months ago
hp-Optimal discontinuous Galerkin methods for linear elliptic problems
Abstract. The aim of this paper is to present and analyze a class of hpversion discontinuous Galerkin (DG) discretizations for the numerical approximation of linear elliptic proble...
Benjamin Stamm, Thomas P. Wihler
ICASSP
2011
IEEE
12 years 11 months ago
A family of algorithms for blind equalization of QAM signals
We propose blind equalization algorithms that perform similarly to supervised ones, independently of the QAM order. They converge approximately to the Wiener solution, which gener...
Joao Mendes Filho, Magno T. M. Silva, Maria D. Mir...