Sciweavers

238 search results - page 9 / 48
» Learning Recursive Automata from Positive Examples
Sort
View
ICIAR
2009
Springer
14 years 2 months ago
An Example-Based Two-Step Face Hallucination Method through Coefficient Learning
Face hallucination is to reconstruct a high-resolution face image from a low-resolution one based on a set of high- and low-resolution training image pairs. This paper proposes an ...
Xiang Ma, Junping Zhang, Chun Qi
COLT
1992
Springer
13 years 11 months ago
Language Learning from Stochastic Input
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
Shyam Kapur, Gianfranco Bilardi
COLING
2002
13 years 7 months ago
Study of Practical Effectiveness for Machine Translation Using Recursive Chain-link-type Learning
A number of machine translation systems based on the learning algorithms are presented. These methods acquire translation rules from pairs of similar sentences in a bilingual text...
Hiroshi Echizen-ya, Kenji Araki, Yoshio Momouchi, ...
ALT
2010
Springer
13 years 7 months ago
Recursive Teaching Dimension, Learning Complexity, and Maximum Classes
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...
Thorsten Doliwa, Hans-Ulrich Simon, Sandra Zilles
RTA
2010
Springer
13 years 11 months ago
Automata for Data Words and Data Trees
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
Mikolaj Bojanczyk