56 search results - page 7 / 12 » Tree Distance and Some Other Variants of Evalb |
SIAMCO
2010
13 years 2 months ago
2010
We study a simple continuous-time multiagent system related to Krause's model of opinion dynamics: each agent holds a real value, and this value is continuously attracted by e...
ALENEX
2010
13 years 8 months ago
2010
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...
ECAI
2000
Springer
13 years 11 months ago
2000
Springer
In this paper, an editing algorithm based on the projection of the examples in each dimension is presented. The algorithm, that we have called EOP (Editing by Ordered Projection) h...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
LACL
1998
Springer
13 years 11 months ago
1998
Springer
In this paper we give a formal description of the parsing model that underlies the treatment of Long Distance Dependencies, Topic and Focus, Ellipsis and Quantification in, amongs...