Sciweavers

15 search results - page 3 / 3
» Iterated Hard Shrinkage for Minimization Problems with Spars...
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Healing the relevance vector machine through augmentation
The Relevance Vector Machine (RVM) is a sparse approximate Bayesian kernel method. It provides full predictive distributions for test cases. However, the predictive uncertainties ...
Carl Edward Rasmussen, Joaquin Quiñonero Ca...
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
14 years 1 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
SIAMCO
2002
71views more  SIAMCO 2002»
13 years 7 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
PLDI
2004
ACM
14 years 23 days ago
Vectorization for SIMD architectures with alignment constraints
When vectorizing for SIMD architectures that are commonly employed by today’s multimedia extensions, one of the new challenges that arise is the handling of memory alignment. Pr...
Alexandre E. Eichenberger, Peng Wu, Kevin O'Brien
TSE
2010
132views more  TSE 2010»
13 years 2 months ago
ASCENT: An Algorithmic Technique for Designing Hardware and Software in Tandem
Search-based software engineering is an emerging paradigm that uses automated search algorithms to help designers iteratively find solutions to complicated design problems. For exa...
Jules White, Brian Doughtery, Douglas C. Schmidt