Sciweavers

10054 search results - page 1841 / 2011
» On the Complexity of Function Learning
Sort
View
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 8 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
ECAL
1999
Springer
15 years 8 months ago
A Generic Neutral Model for Quantitative Comparison of Genotypic Evolutionary Activity
We use a new general-purpose model of neutral evolution of genotypes to make quantitative comparisons of diversity and adaptive evolutionary activity as a function of mutation rate...
Andreas Rechtsteiner, Mark A. Bedau
ECOOP
1999
Springer
15 years 8 months ago
Foundations for Virtual Types
Virtual types have been proposed as a notation for generic programming in object-oriented languages—an alternative to the more familiar mechanism of parametric classes. The trade...
Atsushi Igarashi, Benjamin C. Pierce
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
15 years 8 months ago
Decision Oracles are Equivalent to Matching Oracles
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
Helena Handschuh, Yiannis Tsiounis, Moti Yung
TSD
1999
Springer
15 years 8 months ago
Prague Dependency Treebank: Restoration of Deletions
The use of the treebank as a resource for linguistic research has led us to look for an annotation scheme representing not only surface syntactic information (in ‘analytic trees...
Eva Hajicová, Ivana Kruijff-Korbayová...
« Prev « First page 1841 / 2011 Last » Next »