Sciweavers

163 search results - page 16 / 33
» Average-Case Active Learning with Costs
Sort
View
ISNN
2007
Springer
14 years 1 months ago
Sparse Coding in Sparse Winner Networks
This paper investigates a mechanism for reliable generation of sparse code in a sparsely connected, hierarchical, learning memory. Activity reduction is accomplished with local com...
Janusz A. Starzyk, Yinyin Liu, David D. Vogel
IJCNN
2008
IEEE
14 years 1 months ago
Adaptive curiosity for emotions detection in speech
— Exploratory activities seem to be crucial for our cognitive development. According to psychologists, exploration is an intrinsically rewarding behaviour. The developmental robo...
Alexis Bondu, Vincent Lemaire
FGR
2008
IEEE
176views Biometrics» more  FGR 2008»
14 years 1 months ago
Learning image alignment without local minima for face detection and tracking
Active Appearance Models (AAMs) have been extensively used for face alignment during the last 20 years. While AAMs have numerous advantages relative to alternate approaches, they ...
Minh Hoai Nguyen, Fernando De la Torre
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
13 years 12 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
UAI
2004
13 years 8 months ago
Active Model Selection
Classical learning assumes the learner is given a labeled data sample, from which it learns a model. The field of Active Learning deals with the situation where the learner begins...
Omid Madani, Daniel J. Lizotte, Russell Greiner