2310 search results - page 263 / 462 » Coloring Random Graphs |
DAGM
2010
Springer
13 years 9 months ago
2010
Springer
A multi-class traffic scene segmentation approach based on scene flow data is presented. Opposed to many other approaches using color or texture features, our approach is purely ba...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
ICALP
1992
Springer
14 years 8 days ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
ENDM
2008
13 years 8 months ago
2008
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
SPAA
2009
ACM
14 years 3 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...