Sciweavers

1957 search results - page 69 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
ESANN
2007
14 years 11 months ago
Model Selection for Kernel Probit Regression
Abstract. The convex optimisation problem involved in fitting a kernel probit regression (KPR) model can be solved efficiently via an iteratively re-weighted least-squares (IRWLS)...
Gavin C. Cawley
ML
2007
ACM
192views Machine Learning» more  ML 2007»
14 years 9 months ago
Annealing stochastic approximation Monte Carlo algorithm for neural network training
We propose a general-purpose stochastic optimization algorithm, the so-called annealing stochastic approximation Monte Carlo (ASAMC) algorithm, for neural network training. ASAMC c...
Faming Liang
ICPR
2006
IEEE
15 years 11 months ago
A Non-Iterative Approach to Reconstruct Face Templates from Match Scores
Regeneration of biometric templates from match scores has security and privacy implications related to any biometric based authentication system. In this paper, we propose a novel...
Pranab Mohanty, Rangachar Kasturi, Sudeep Sarkar
CVPR
2009
IEEE
1372views Computer Vision» more  CVPR 2009»
16 years 4 months ago
Blind motion deblurring from a single image using sparse approximation
Restoring a clear image from a single motion-blurred image due to camera shake has long been a challenging problem in digital imaging. Existing blind deblurring techniques eithe...
Jian-Feng Cai (National University of Singapore), ...
ANOR
2002
100views more  ANOR 2002»
14 years 9 months ago
A Limited-Memory Multipoint Symmetric Secant Method for Bound Constrained Optimization
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...
Oleg P. Burdakov, José Mario Martíne...