1391 search results - page 35 / 279 » Optimally Sparse Frames |
222
click to vote
TIP
2008
15 years 7 months ago
2008
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
204
click to vote
RTSS
2007
IEEE
16 years 1 months ago
2007
IEEE
— Many applications of sensor networks require the base station to collect all the data generated by sensor nodes. As a consequence many-to-one communication pattern, referred to...
163
click to vote
SIAMJO
2008
15 years 7 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
249
click to vote
NAA
2004
Springer
16 years 16 days ago
2004
Springer
In this paper, we develop a probabilistic model for estimation of the numbers of cache misses during the sparse matrix-vector multiplication (for both general and symmetric matrice...
177
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
Recently proposed l1-regularized maximum-likelihood optimization methods for learning sparse Markov networks result into convex problems that can be solved optimally and efficien...