Sciweavers

1363 search results - page 56 / 273
» The road coloring problem
Sort
View
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
15 years 4 months ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
Venkatesan Guruswami, Ali Kemal Sinop
ECCV
1992
Springer
15 years 1 months ago
Data and Model-Driven Selection using Color Regions
A key problem in model-based object recognition is selection, namely, the problem of determining which regions in the image are likely to come from a single object. In this paper w...
Tanveer Fathima Syeda-Mahmood
KES
2000
Springer
15 years 1 months ago
Knowledge based genetic algorithm for dynamic route selection
This paper addresses the problem of selecting route to a given destination on a load map under a dynamic environment. The proposed solution is using a genetic algorithm adopting v...
Hitoshi Kanoh, Tomohiro Nakamura
ICDAR
2005
IEEE
15 years 3 months ago
Text Extraction from Name Cards with Complex Design
This paper addresses the problem of text extraction from name card images with fanciful design containing complicated color background and reverse contrast regions. The proposed m...
Lin Lin, Chew Lim Tan
IJCNN
2007
IEEE
15 years 4 months ago
Risk Assessment Algorithms Based on Recursive Neural Networks
— The assessment of highly-risky situations at road intersections have been recently revealed as an important research topic within the context of the automotive industry. In thi...
Alejandro Chinea Manrique De Lara, Michel Parent