Sciweavers

3607 search results - page 248 / 722
» Learning with structured sparsity
Sort
View
TSP
2008
151views more  TSP 2008»
15 years 5 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
CIKM
2010
Springer
15 years 3 months ago
Generating advertising keywords from video content
With the proliferation of online distribution methods for videos, content owners require easier and more effective methods for monetization through advertising. Matching advertis...
Michael J. Welch, Junghoo Cho, Walter Chang
IJHPCA
2010
84views more  IJHPCA 2010»
15 years 3 months ago
Operation Stacking for Ensemble Computations With Variable Convergence
Sparse matrix operations achieve only small fractions of peak CPU speeds because of the use of specialized, indexbased matrix representations, which degrade cache utilization by i...
Mehmet Belgin, Godmar Back, Calvin J. Ribbens
TASLP
2010
188views more  TASLP 2010»
15 years 3 months ago
MusicBox: Personalized Music Recommendation Based on Cubic Analysis of Social Tags
—Social tagging is becoming increasingly popular in music information retrieval (MIR). It allows users to tag music items like songs, albums, or artists. Social tags are valuable...
Alexandros Nanopoulos, Dimitrios Rafailidis, Panag...
191
Voted
CORR
2011
Springer
167views Education» more  CORR 2011»
15 years 1 days ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...