469 search results - page 39 / 94 » Directed Graphs of Entanglement Two |
ECEASST
2006
13 years 7 months ago
2006
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
STACS
2001
Springer
14 years 2 days ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
SRDS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
ICCV
2001
IEEE
14 years 9 months ago
2001
IEEE
We propose a method of image segmentation by integrating pairwise attraction and directional repulsion derived from local grouping and figure-ground cues. These two kinds of pairw...