Sciweavers

762 search results - page 42 / 153
» Intercode Regular Languages
Sort
View
STACS
2004
Springer
15 years 7 months ago
Active Context-Free Games
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo ...
Anca Muscholl, Thomas Schwentick, Luc Segoufin
ICGI
2000
Springer
15 years 6 months ago
Computation of Substring Probabilities in Stochastic Grammars
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
Ana L. N. Fred
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 9 months ago
Primitive words and roots of words
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
Gerhard Lischke
135
Voted
NIPS
2004
15 years 3 months ago
Learning, Regularization and Ill-Posed Inverse Problems
Many works have shown that strong connections relate learning from examples to regularization techniques for ill-posed inverse problems. Nevertheless by now there was no formal ev...
Lorenzo Rosasco, Andrea Caponnetto, Ernesto De Vit...
HIS
2009
15 years 3 days ago
Implementing and Evaluating a Rule-Based Approach to Querying Regular EL+ Ontologies
Recent years have witnessed the wide recognition of the importance of ontology and rule in the AI research. In this paper, we report our implementation and evaluation of a rule-ba...
Yuting Zhao, Jeff Z. Pan, Yuan Ren