Sciweavers

5052 search results - page 8 / 1011
» On the Complexity of Ordered Colorings
Sort
View
ICIP
2001
IEEE
14 years 9 months ago
Color segmentation through independent anisotropic diffusion of complex chromaticity and lightness
This paper presents a new technique based on anisotropic diffusion for segmenting color images. This operation is accomplished through two independent anisotropic diffusion proces...
Luca Lucchese, Sanjit K. Mitra
COCOON
2007
Springer
14 years 1 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...
COMBINATORICS
2007
81views more  COMBINATORICS 2007»
13 years 7 months ago
The m-Colored Composition Poset
We define a partial order on colored compositions with many properties analogous to Young’s lattice. We show that saturated chains correspond to colored permutations, and that ...
Brian Drake, T. Kyle Petersen
JCT
2008
132views more  JCT 2008»
13 years 7 months ago
The absolute order on the symmetric group, constructible partially ordered sets and Cohen-Macaulay complexes
The absolute order is a natural partial order on a Coxeter group W. It can be viewed as an analogue of the weak order on W in which the role of the generating set of simple reflec...
Christos A. Athanasiadis, Myrto Kallipoliti
ISCA
2008
IEEE
134views Hardware» more  ISCA 2008»
14 years 1 months ago
Achieving Out-of-Order Performance with Almost In-Order Complexity
There is still much performance to be gained by out-of-order processors with wider issue widths. However, traditional methods of increasing issue width do not scale; that is, they...
Francis Tseng, Yale N. Patt