Sciweavers

9886 search results - page 1844 / 1978
» Learning Compressible Models
Sort
View
121
Voted
DIS
1998
Springer
15 years 7 months ago
Uniform Characterizations of Polynomial-Query Learnabilities
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...
Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara...
128
Voted
ISCA
1997
IEEE
137views Hardware» more  ISCA 1997»
15 years 7 months ago
A Language for Describing Predictors and Its Application to Automatic Synthesis
As processor architectures have increased their reliance on speculative execution to improve performance, the importance of accurate prediction of what to execute speculatively ha...
Joel S. Emer, Nicholas C. Gloy
109
Voted
AGENTS
1997
Springer
15 years 7 months ago
Adaptable Local Level Arbitration of Behaviors
During the last few years, and in an attempt to provide an ecient alternative to classical methods to designing robot control structures, the behavior-based approach has emerged....
Mohamed Salah Hamdi, Karl Kaiser
120
Voted
FOCS
1993
IEEE
15 years 7 months ago
Scale-sensitive Dimensions, Uniform Convergence, and Learnability
Learnability in Valiant’s PAC learning model has been shown to be strongly related to the existence of uniform laws of large numbers. These laws define a distribution-free conver...
Noga Alon, Shai Ben-David, Nicolò Cesa-Bian...
88
Voted
SIGCSE
1993
ACM
102views Education» more  SIGCSE 1993»
15 years 7 months ago
The internet programming contest: a report and philosophy
Programming contests can provide a high-profile method for attracting interest in computer science. We describe our philosophy as it pertains to the purpose and merits of program...
Vivek Khera, Owen L. Astrachan, David Kotz
« Prev « First page 1844 / 1978 Last » Next »