Sciweavers

1004 search results - page 121 / 201
» Product representations of polynomials
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
On the identification of parametric underspread linear systems
Identification of time-varying linear systems, which introduce both time-shifts (delays) and frequency-shifts (Doppler-shifts), is a central task in many engineering applications...
Waheed U. Bajwa, Kfir Gedalyahu, Yonina C. Eldar
ICCV
2011
IEEE
13 years 9 months ago
Gradient-based learning of higher-order image features
Recent work on unsupervised feature learning has shown that learning on polynomial expansions of input patches, such as on pair-wise products of pixel intensities, can improve the...
Roland Memisevic
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
15 years 11 months ago
Forward Decay: A Practical Time Decay Model for Streaming Systems
Temporal data analysis in data warehouses and data streaming systems often uses time decay to reduce the importance of older tuples, without eliminating their influence, on the res...
Graham Cormode, Vladislav Shkapenyuk, Divesh Sriva...
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
15 years 10 months ago
New direct-product testers and 2-query PCPs
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
15 years 4 months ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
Venkatesan Guruswami, Atri Rudra