2294 search results - page 210 / 459 » From Path Graphs to Directed Path Graphs |
119
click to vote
SEMWEB
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. RDF Graphs are sets of assertions in the form of subjectpredicate-object triples of information resources. Although for simple examples they can be understood intuitively...
127
click to vote
EACL
1989
ACL Anthology
15 years 4 months ago
1989
ACL Anthology
We propose an apparently minor extension to Kay's (1985} notation for describing directed acyclic graphs (DAGs}. The proposed notation permits concise descriptions of phenome...
112
click to vote
AIPS
2000
15 years 4 months ago
2000
Themostefficient planning algorithms recently developed are mainly based on Graphplansystem or on satisfiability approach. In this paper wepresent a new approach to plan generatio...
148
click to vote
ICIP
2009
IEEE
15 years 18 days ago
2009
IEEE
This paper deals with the problem of efficiently computing the optical flow of image sequences acquired by omnidirectional (nearly full field of view) cameras. We formulate the pr...
158
click to vote
GC
2010
Springer
15 years 1 months ago
2010
Springer
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...