Sciweavers

5109 search results - page 664 / 1022
» On Learning Limiting Programs
Sort
View
ICALP
2005
Springer
15 years 12 months ago
All Quantum Adversary Methods Are Equivalent
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
Robert Spalek, Mario Szegedy
LPAR
2005
Springer
15 years 12 months ago
Disjunctive Constraint Lambda Calculi
Abstract. Earlier we introduced Constraint Lambda Calculi which integrate constraint solving with functional programming for the simple case where the constraint solver produces no...
Matthias M. Hölzl, John N. Crossley
OOPSLA
2005
Springer
15 years 12 months ago
Inferring context-free grammars for domain-specific languages
Grammatical inference (or grammar inference) has been applied to various problems in areas such as computational biology, and speech and pattern recognition but its application to...
Faizan Javed
PKDD
2005
Springer
153views Data Mining» more  PKDD 2005»
15 years 12 months ago
A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...
Marc Wörlein, Thorsten Meinl, Ingrid Fischer,...
WRAC
2005
Springer
15 years 12 months ago
Autonomy Without Independence: Animal Training as a Model for Robot Design
A classic autonomous robot is an autonomous agent for open, unpredictable environments. Such an agent is inherently autonomous but not independent. Independence implies unpredictab...
David C. Wyland