570 search results - page 78 / 114 » Edge Coloring with Delays |
172
click to vote
Publication
Given a single image of an arbitrary road, that may not be well-paved, or have clearly delineated edges, or some a priori known color or texture distribution, is it possible for a ...
142
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper presents a new Geometric Active Contour (GAC) model based on Lennard-Jones (L-J) force field, which is inspired by the theory of intermolecular interaction. It is diff...
133
click to vote
ICTAI
2006
IEEE
15 years 10 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
125
click to vote
MFCS
1995
Springer
15 years 8 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
139
click to vote
DM
1998
15 years 4 months ago
1998
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...