1154 search results - page 159 / 231 » On the editing distance of graphs |
146
click to vote
AIPS
2004
15 years 7 months ago
2004
Scaling conformant planning is a problem that has received much attention of late. Many planners solve the problem as a search in the space of belief states, and some heuristic gu...
154
click to vote
ACL
2003
15 years 7 months ago
2003
This paper presents a dependency language model (DLM) that captures linguistic constraints via a dependency structure, i.e., a set of probabilistic dependencies that express the r...
155
click to vote
DM
2006
15 years 6 months ago
2006
The eccentric digraph ED(G) of a digraph G represents the binary relation, defined on the vertex set of G, of being `eccentric'; that is, there is an arc from u to v in ED(G)...
113
click to vote
ENDM
2006
15 years 6 months ago
2006
In this note, we prove the uniqueness of the one-point extension S of a generalized hexagon of order 2 and prove the non-existence of such an extension S of any other finite gener...
146
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour ...