Sciweavers

15 search results - page 2 / 3
» Self-Testing Correcting for Polynomials and for Approximate ...
Sort
View
IJCAI
1993
13 years 6 months ago
Learning Decision Lists over Tree Patterns and Its Application
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
Satoshi Kobayashi, Koichi Hori, Setsuo Ohsuga
ITA
2007
101views Communications» more  ITA 2007»
13 years 5 months ago
Learning tree languages from text
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
Henning Fernau
DCC
2005
IEEE
14 years 4 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
13 years 9 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
ICLP
2010
Springer
13 years 3 months ago
A Framework for Verification and Debugging of Resource Usage Properties: Resource Usage Verification
We present a framework for (static) verification of general resource usage program properties. The framework extends the criteria of correctness as the conformance of a program to ...
Pedro López-García, Luthfi Darmawan,...