Sciweavers

220 search results - page 31 / 44
» SMOS L1 algorithms
Sort
View
NIPS
2003
13 years 9 months ago
Sparse Representation and Its Applications in Blind Source Separation
In this paper, sparse representation (factorization) of a data matrix is first discussed. An overcomplete basis matrix is estimated by using the K−means method. We have proved ...
Yuanqing Li, Andrzej Cichocki, Shun-ichi Amari, Se...
PODS
2009
ACM
100views Database» more  PODS 2009»
14 years 8 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
FOCS
2000
IEEE
14 years 3 days ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
ECIR
2010
Springer
13 years 5 months ago
Maximum Margin Ranking Algorithms for Information Retrieval
Abstract. Machine learning ranking methods are increasingly applied to ranking tasks in information retrieval (IR). However ranking tasks in IR often differ from standard ranking t...
Shivani Agarwal, Michael Collins
JMLR
2011
157views more  JMLR 2011»
13 years 2 months ago
Variable Sparsity Kernel Learning
This paper1 presents novel algorithms and applications for a particular class of mixed-norm regularization based Multiple Kernel Learning (MKL) formulations. The formulations assu...
Jonathan Aflalo, Aharon Ben-Tal, Chiranjib Bhattac...