Sciweavers

701 search results - page 36 / 141
» Self Bounding Learning Algorithms
Sort
View
FLAIRS
2010
13 years 12 months ago
Gamed-Based iSTART Practice: From MiBoard to Self-Explanation Showdown
MiBoard (Multiplayer Interactive Board Game) is an online, turnbased board game that was developed to assess the integration of game characteristics (point rewards, game-like inte...
Justin F. Brunelle
ICPADS
2006
IEEE
14 years 3 months ago
Fast Convergence in Self-Stabilizing Wireless Networks
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
Nathalie Mitton, Eric Fleury, Isabelle Guér...
COLT
2000
Springer
14 years 2 months ago
Computable Shell Decomposition Bounds
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves suc...
John Langford, David A. McAllester
VLDB
2006
ACM
162views Database» more  VLDB 2006»
14 years 10 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
14 years 3 months ago
Is negative selection appropriate for anomaly detection?
Negative selection algorithms for hamming and real-valued shape-spaces are reviewed. Problems are identified with the use of these shape-spaces, and the negative selection algori...
Thomas Stibor, Philipp H. Mohr, Jonathan Timmis, C...