Sciweavers

2661 search results - page 453 / 533
» Quantum Complexity Classes
Sort
View
NEUROSCIENCE
2001
Springer
15 years 5 months ago
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
Doina Caragea, Adrian Silvescu, Vasant Honavar
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 5 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
146
Voted
ICSE
1999
IEEE-ACM
15 years 5 months ago
Exploiting Smalltalk Modules in a Customizable Programming Environment
This paper describes how we have extended a module structure of the Smalltalk LearningWorks to provide a programming environment deigned for very large scale technology transfer. ...
Mark Woodman, Robert Griffiths, Malcolm Macgregor,...
134
Voted
DBPL
1997
Springer
90views Database» more  DBPL 1997»
15 years 5 months ago
Implementing Incremental View Maintenance in Nested Data Models
Previous research on materialized views has primarily been in the context of flat relational databases--materialized views defined in terms of one or more flat relations. This pape...
Akira Kawaguchi, Daniel F. Lieuwen, Inderpal Singh...
111
Voted
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
15 years 5 months ago
Optimal equivalent circuits for interconnect delay calculations using moments
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
Sudhakar Muddu, Andrew B. Kahng