Sciweavers

1363 search results - page 6 / 273
» The road coloring problem
Sort
View
DAM
2007
94views more  DAM 2007»
14 years 9 months ago
The harmonious coloring problem is NP-complete for interval and permutation graphs
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...
Katerina Asdre, Kyriaki Ioannidou, Stavros D. Niko...

Publication
234views
13 years 26 days ago
Road Scene Understanding from a Single Image
Road scene segmentation is important in computer vision for different applications such as autonomous driving and pedestrian detection. Recovering the 3D structure of road scenes ...
Jose M. Alvarez, Theo Gevers, Yann LeCun, Antonio ...
ISDA
2009
IEEE
15 years 4 months ago
GPU-Based Road Sign Detection Using Particle Swarm Optimization
—Road Sign Detection is a major goal of Advanced Driving Assistance Systems (ADAS). Since the dawn of this discipline, much work based on different techniques has been published ...
Luca Mussi, Stefano Cagnoni, Fabio Daolio
ICRA
2008
IEEE
114views Robotics» more  ICRA 2008»
15 years 4 months ago
Mobile robot control in the road sign problem using Reservoir Computing networks
— In this work we tackle the road sign problem with Reservoir Computing (RC) networks. The T-maze task (a particular form of the road sign problem) consists of a robot in a T-sha...
Eric A. Antonelo, Benjamin Schrauwen, Dirk Strooba...
AAAI
2010
14 years 11 months ago
High-Quality Policies for the Canadian Traveler's Problem
We consider the stochastic variant of the Canadian Traveler's Problem, a path planning problem where adverse weather can cause some roads to be untraversable. The agent does ...
Patrick Eyerich, Thomas Keller, Malte Helmert