5075 search results - page 575 / 1015 » Convergence |
243
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
207
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The theory revision problem is the problem of how best to go about revising a deficient domain theory using information contained in examples that expose inaccuracies. In this pa...
167
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We propose Shotgun, a parallel coordinate descent algorithm for minimizing L1regularized losses. Though coordinate descent seems inherently sequential, we prove convergence bounds...
187
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we present a model for unsupervised pattern discovery using non-negative matrix factorization (NMF) with graph regularization. Though the regularization can be appl...
188
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Matrix optimization with orthogonal constraints appear in a variety of application fields including signal and image processing. Several researchers have developed algorithms for...