Sciweavers

779 search results - page 40 / 156
» Information-theoretic Competitive Learning
Sort
View
CRYPTO
2012
Springer
217views Cryptology» more  CRYPTO 2012»
11 years 11 months ago
Securing Circuits against Constant-Rate Tampering
We present a compiler that converts any circuit into one that remains secure even if a constant fraction of its wires are tampered with. Following the seminal work of Ishai et al. ...
Dana Dachman-Soled, Yael Tauman Kalai
ICML
2004
IEEE
14 years 2 months ago
Towards tight bounds for rule learning
While there is a lot of empirical evidence showing that traditional rule learning approaches work well in practice, it is nearly impossible to derive analytical results about thei...
Ulrich Rückert, Stefan Kramer
NECO
1998
168views more  NECO 1998»
13 years 8 months ago
Constructive Incremental Learning from Only Local Information
We introduce a constructive, incremental learning system for regression problems that models data by means of spatially localized linear models. In contrast to other approaches, t...
Stefan Schaal, Christopher G. Atkeson
AGENTS
1999
Springer
14 years 1 months ago
On Being a Teammate: Experiences Acquired in the design of RoboCup Teams
Increasingly, multi-agent systems are being designed for a variety of complex, dynamic domains. E ective agent interactions in such domains raise some of most fundamental research...
Stacy Marsella, Jafar Adibi, Yaser Al-Onaizan, Gal...
ICDM
2005
IEEE
163views Data Mining» more  ICDM 2005»
14 years 2 months ago
Balancing Exploration and Exploitation: A New Algorithm for Active Machine Learning
Active machine learning algorithms are used when large numbers of unlabeled examples are available and getting labels for them is costly (e.g. requiring consulting a human expert)...
Thomas Takeo Osugi, Kun Deng, Stephen D. Scott