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...
: 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...
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...
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...
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...