1999 search results - page 142 / 400 » Dependently Typed Grammars |
181
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
166
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
198
click to vote
IS
2008
15 years 6 months ago
2008
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
158
click to vote
JIIS
2008
15 years 6 months ago
2008
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...
145
click to vote
COGSCI
2004
15 years 6 months ago
2004
The dominant theory of what people can learn implicitly is that they learn chunks of adjacent elements in sequences. A type of musical grammar that goes beyond specifying allowabl...