44 search results - page 7 / 9 » Approximation Bounds for Some Sparse Kernel Regression Algor... |
ICASSP
2011
IEEE
12 years 10 months ago
2011
IEEE
Compressive sensing accurately reconstructs a signal that is sparse in some basis from measurements, generally consisting of the signal’s inner products with Gaussian random vec...
STACS
2007
Springer
14 years 21 days ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
JMLR
2011
13 years 1 months ago
2011
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...
SIAMMAX
2010
13 years 1 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
DC
2010
13 years 6 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...