Sciweavers

2374 search results - page 35 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
PAKDD
2000
ACM
161views Data Mining» more  PAKDD 2000»
15 years 1 months ago
Adaptive Boosting for Spatial Functions with Unstable Driving Attributes
Combining multiple global models (e.g. back-propagation based neural networks) is an effective technique for improving classification accuracy by reducing a variance through manipu...
Aleksandar Lazarevic, Tim Fiez, Zoran Obradovic
84
Voted
ICASSP
2011
IEEE
14 years 1 months ago
Joint blind source separation from second-order statistics: Necessary and sufficient identifiability conditions
This paper considers the problem of joint blind source separation (J-BSS), which appears in many practical problems such as blind deconvolution or functional magnetic resonance im...
Javier Vía, Matthew Anderson, Xi-Lin Li, T&...
84
Voted
IPSN
2005
Springer
15 years 3 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
DSP
2007
14 years 9 months ago
Variational and stochastic inference for Bayesian source separation
We tackle the general linear instantaneous model (possibly underdetermined and noisy) where we model the source prior with a Student t distribution. The conjugate-exponential char...
Ali Taylan Cemgil, Cédric Févotte, S...
CORR
2010
Springer
253views Education» more  CORR 2010»
14 years 9 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...