Sciweavers

1363 search results - page 52 / 273
» The road coloring problem
Sort
View
MFCS
2007
Springer
15 years 3 months ago
NP by Means of Lifts and Shadows
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
Gábor Kun, Jaroslav Nesetril
IJIIDS
2008
95views more  IJIIDS 2008»
14 years 9 months ago
Tightly-coupled GIS data in GNSS fix computations with integrity testing
: Global Navigation Satellite Systems (GNSS) are often used to localise a receiver with respect to a given map. This association problem, also known as map-matching, is usually add...
Clément Fouque, Philippe Bonnifait
CVPR
2005
IEEE
15 years 11 months ago
Local Color Transfer via Probabilistic Segmentation by Expectation-Maximization
We address the problem of regional color transfer between two natural images by probabilistic segmentation. We use a new Expectation-Maximization (EM) scheme to impose both spatia...
Yu-Wing Tai, Jiaya Jia, Chi-Keung Tang
CHI
2010
ACM
15 years 4 months ago
Individual models of color differentiation to improve interpretability of information visualization
Color is commonly used to represent categories and values in many computer applications, but differentiating these colors can be difficult in many situations (e.g., for users with...
David R. Flatla, Carl Gutwin
COCOON
2007
Springer
15 years 4 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...