46 search results - page 6 / 10 » Partial Characterizations of Circular-Arc Graphs |
CIKM
2007
Springer
14 years 2 months ago
2007
Springer
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
COMBINATORICS
2000
13 years 8 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
CVPR
1999
IEEE
14 years 22 days ago
1999
IEEE
We address the problem of detection and tracking of moving objects in a video stream obtained from a moving airborne platform. The proposed method relies on a graph representation...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
In this paper, we investigate limiting behavior of linear dynamic systems driven by random stochastic matrices. We introduce and study the new concepts of partial ergodicity and 1-...
OPODIS
2008
13 years 9 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...