Sciweavers

1363 search results - page 15 / 273
» The road coloring problem
Sort
View
64
Voted
ICAI
2008
14 years 11 months ago
Computationally Efficient Path-Following using Adaptive Color Models
The ability to follow man-made paths and roads is an important capability for a number of robotic tasks. To operate in outdoor environments designed for humans, autonomous robots m...
Stuart Glaser, Eitan Marder-Eppstein, William Smar...
75
Voted
COCOON
2005
Springer
15 years 3 months ago
Oblivious and Adaptive Strategies for the Majority and Plurality Problems
In the well-studied Majority problem, we are given a set of n balls colored with two or more colors, and the goal is to use the minimum number of color comparisons to find a ball ...
Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew...
SOFSEM
2009
Springer
15 years 6 months ago
The Shortcut Problem - Complexity and Approximation
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delli...
IPL
2002
110views more  IPL 2002»
14 years 9 months ago
New bounds on a hypercube coloring problem
In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices wh...
Hung Q. Ngo, Ding-Zhu Du, Ronald L. Graham
ICCV
1998
IEEE
15 years 11 months ago
Signfinder: Using Color to Detect, Localize and Identify Informational Signs
We describe an approach to detecting, locating and normalizing road signs. The approach will apply provided: (i) the signs have stereotypical boundary shapes (i.e. rectangular, or...
Alan L. Yuille, Daniel Snow, Mark Nitzberg