1208 search results - page 9 / 242 » On Counting Generalized Colorings |
73
Voted
ICIP
2001
IEEE
15 years 11 months ago
2001
IEEE
Wc optimizc thc noisc shaping bchavior of color crror diffusion by designing an optirnizcd crror filtcr bascd on a proposed noisc shaping modcl for color crror diffusion and a gcn...
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
DAM
2002
14 years 9 months ago
2002
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We establish a simple generalization of a known result in the plane. The simplices in any pure simplicial complex in Rd may be colored with d+1 colors so that no two simplices tha...
ICCVW
1999
Springer
15 years 1 months ago
1999
Springer
Image-based reconstruction from randomly scattered views is a challenging problem. We present a new algorithm that extends Seitz and Dyer’s Voxel Coloring algorithm. Unlike their...