Sciweavers

414 search results - page 24 / 83
» On discrete norms of polynomials
Sort
View
ICC
2007
IEEE
116views Communications» more  ICC 2007»
14 years 4 months ago
Interference Detection in Spread Spectrum Communication Using Polynomial Phase Transform
—In this paper we propose an interference detection technique for detecting time varying jamming signals in spread spectrum communication systems. The technique is based on Discr...
Randa Zarifeh, Nandini Alinier, Sridhar Krishnan, ...
TSP
2008
74views more  TSP 2008»
13 years 9 months ago
Performance of ESPRIT for Estimating Mixtures of Complex Exponentials Modulated by Polynomials
High Resolution (HR) methods are known to provide accurate frequency estimates for discrete spectra. The Polynomial Amplitude Complex Exponentials (PACE) model, also called quasipo...
Roland Badeau, Gaël Richard, Bertrand David
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 10 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
CORR
2011
Springer
261views Education» more  CORR 2011»
13 years 5 months ago
Convex and Network Flow Optimization for Structured Sparsity
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
JCO
2011
115views more  JCO 2011»
13 years 5 months ago
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
Chen Liao, Shiyan Hu