Sciweavers

216 search results - page 29 / 44
» On the number of minima of a random polynomial
Sort
View
JSAC
2008
105views more  JSAC 2008»
13 years 7 months ago
Vector Precoding for Wireless MIMO Systems and its Replica Analysis
This paper studies a nonlinear vector precoding scheme which inverts the wireless multiple-input multiple-output (MIMO) channel at the transmitter so that simple symbol-bysymbol de...
Ralf R. Müller, Dongning Guo, Aris L. Moustak...
ALT
2006
Springer
14 years 4 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
SDM
2007
SIAM
171views Data Mining» more  SDM 2007»
13 years 9 months ago
A Better Alternative to Piecewise Linear Time Series Segmentation
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Daniel Lemire
CORR
2011
Springer
193views Education» more  CORR 2011»
12 years 11 months ago
The Rate of Convergence of AdaBoost
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
Indraneel Mukherjee, Cynthia Rudin, Robert E. Scha...
STOC
2002
ACM
96views Algorithms» more  STOC 2002»
14 years 8 months ago
Near-optimal sparse fourier representations via sampling
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Mut...