103 search results - page 3 / 21 » An Efficient Sparse Regularity Concept |
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
MM
2009
ACM
14 years 1 months ago
2009
ACM
In this paper, we exploit the problem of inferring images’ semantic concepts from community-contributed images and their associated noisy tags. To infer the concepts more accura...
TSP
2008
13 years 7 months ago
2008
Abstract-- The FOCal Underdetermined System Solver (FOCUSS) algorithm has already found many applications in signal processing and data analysis, whereas the regularized MFOCUSS al...