Sciweavers

224 search results - page 36 / 45
» Bounding Learning Time in XCS
Sort
View
DIS
2006
Springer
14 years 5 days ago
Incremental Algorithm Driven by Error Margins
Incremental learning is an approach to deal with the classification task when datasets are too large or when new examples can arrive at any time. One possible approach uses concent...
Gonzalo Ramos-Jiménez, José del Camp...
EUROCOLT
1997
Springer
14 years 19 days ago
Vapnik-Chervonenkis Dimension of Recurrent Neural Networks
Most of the work on the Vapnik-Chervonenkis dimension of neural networks has been focused on feedforward networks. However, recurrent networks are also widely used in learning app...
Pascal Koiran, Eduardo D. Sontag
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
14 years 1 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
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
14 years 8 months ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
CVPR
2009
IEEE
15 years 3 months ago
What's It Going to Cost You?: Predicting Effort vs. Informativeness for Multi-Label Image Annotations
Active learning strategies can be useful when manual labeling effort is scarce, as they select the most informative examples to be annotated first. However, for visual category ...
Sudheendra Vijayanarasimhan (University of Texas a...