1208 search results - page 60 / 242 » On Counting Generalized Colorings |
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
131
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
ICMCS
2006
IEEE
15 years 3 months ago
2006
IEEE
- Restoration of color-quantized images in which error diffusion is involved is rarely addressed in the literature. Conventional restoration algorithms were generally proposed for ...
JCDL
2004
ACM
15 years 3 months ago
2004
ACM
This paper explains a method for leveraging the standard video timeline widget as an interactive visualization of image features. An eye-tracking experiment is described with resu...
COMBINATORICA
2008
14 years 10 months ago
2008
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...