Sciweavers

792 search results - page 143 / 159
» Reading What Machines
Sort
View
88
Voted
ALS
2003
Springer
15 years 2 months ago
Not Everything We Know We Learned
This is foremost a methodological contribution. It focuses on the foundation of anticipation and the pertinent implications that anticipation has on learning (theory and experiment...
Mihai Nadin
88
Voted
ICALP
2010
Springer
15 years 2 months ago
Concurrent Knowledge Extraction in the Public-Key Model
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...
Andrew C. Yao, Moti Yung, Yunlei Zhao
SIGMETRICS
1999
ACM
15 years 1 months ago
Availability and Utility of Idle Memory in Workstation Clusters
In this paper, we examine the availability and utility of idle memory in workstation clusters. We attempt to answer the following questions. First, how much of the total memory in...
Anurag Acharya, Sanjeev Setia
SIGMETRICS
1996
ACM
118views Hardware» more  SIGMETRICS 1996»
15 years 1 months ago
Integrating Performance Monitoring and Communication in Parallel Computers
A large and increasing gap exists between processor and memory speeds in scalable cache-coherent multiprocessors. To cope with this situation, programmers and compiler writers mus...
Margaret Martonosi, David Ofelt, Mark Heinrich
COLT
1993
Springer
15 years 1 months ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum