552 search results - page 1 / 111 » Observable Graphs |
CORR
2007
Springer
13 years 4 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
ICCV
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a monocular SLAM system that avoids inconsistency by coalescing observations into independent local coordinate frames, building a graph of the local frames, and optimiz...
FORTE
2004
13 years 6 months ago
2004
This paper proposes an algorithm for the construction of an MSC graph from a given set of actual behaviors of an existing concurrent system which has repetitive subfunctions. Such ...
SDM
2010
SIAM
13 years 6 months ago
2010
SIAM
Given large, multi-million node graphs (e.g., FaceBook, web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers of the...
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....