1055 search results - page 28 / 211 » Enumerations in computable structure theory |
76
Voted
GG
2004
Springer
15 years 3 months ago
2004
Springer
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
77
Voted
COLING
2000
14 years 11 months ago
2000
A generative statistical model of dependency syntax is proposed based on 'l'csniSre's classical theory. It provides a stochastic formalization of the original model...
LICS
2003
IEEE
15 years 2 months ago
2003
IEEE
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...
78
Voted
CIKM
1997
Springer
15 years 1 months ago
1997
Springer
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
CIE
2005
Springer
14 years 9 months ago
2005
Springer
The attempt of this paper is to describe and analyze the formalisms of pervasive games and pervasive gaming (PG). As the title indicates, PG consists of atomic entities that never...