552 search results - page 7 / 111 » Observable Graphs |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Consider a 0
ECAI
2000
Springer
14 years 14 days ago
2000
Springer
We present a novel approach to plan recognition based on a two-stage paradigm of graph construction and analysis. First, a graph structure called a Goal Graph is constructed to rep...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
We propose a model for the World Wide Web graph that couples the topological growth with the traffic's dynamical evolution. The model is based on a simple traffic-driven dynam...
AAAI
2000
13 years 9 months ago
2000
We present a novel approach to plan recognition in which graph construction and analysis is used as a paradigm. We use a graph structure called a Goal Graph for the plan recogniti...