Sciweavers

957 search results - page 49 / 192
» From Margin to Sparsity
Sort
View
SIGPRO
2010
135views more  SIGPRO 2010»
13 years 6 months ago
A short note on compressed sensing with partially known signal support
This short note studies a variation of the Compressed Sensing paradigm introduced recently by Vaswani et al., i.e. the recovery of sparse signals from a certain number of linear m...
Laurent Jacques
EMNLP
2009
13 years 5 months ago
Mining Search Engine Clickthrough Log for Matching N-gram Features
User clicks on a URL in response to a query are extremely useful predictors of the URL's relevance to that query. Exact match click features tend to suffer from severe data s...
Huihsin Tseng, Longbin Chen, Fan Li, Ziming Zhuang...
TASLP
2010
142views more  TASLP 2010»
13 years 2 months ago
Beyond the Narrowband Approximation: Wideband Convex Methods for Under-Determined Reverberant Audio Source Separation
We consider the problem of extracting the source signals from an under-determined convolutive mixture assuming known mixing filters. State-of-the-art methods operate in the time-fr...
M. Kowalski, Emmanuel Vincent, Rémi Gribonv...
TIT
2010
97views Education» more  TIT 2010»
13 years 2 months ago
Why does the Kronecker model result in misleading capacity estimates?
Many recent works that study the performance of multi-input multi-output (MIMO) systems in practice assume a Kronecker model where the variances of the channel entries, upon decom...
Vasanthan Raghavan, Jayesh H. Kotecha, Akbar M. Sa...
ICASSP
2011
IEEE
12 years 11 months ago
Co-clustering as multilinear decomposition with sparse latent factors
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
Evangelos E. Papalexakis, Nicholas D. Sidiropoulos