Sciweavers

1208 search results - page 7 / 242
» On Counting Generalized Colorings
Sort
View
WAOA
2004
Springer
141views Algorithms» more  WAOA 2004»
14 years 1 months ago
Strong Colorings of Hypergraphs
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
Geir Agnarsson, Magnús M. Halldórsso...
IMAGING
2003
13 years 9 months ago
The Impact of Spectrally-Stable Ink Variability on Spectral Color Management
Typical color image processing techniques use profiles consisting of sparse multi-dimensional lookup tables that interpolate between adjacent nodes to prepare an image for renderi...
Edward F. Hattenberger, Mitchell R. Rosen, Noboru ...
P2P
2009
IEEE
103views Communications» more  P2P 2009»
14 years 2 months ago
Towards Robust Peer Counting
Abstract—This paper describes T-SIZE, a peer counting protocol that is based on gossip-based aggregation. Peer counting has become increasingly important as the size of the netwo...
Alberto Montresor, Ali Ghodsi
COMBINATORICS
2002
99views more  COMBINATORICS 2002»
13 years 7 months ago
A Generalization of Simion-Schmidt's Bijection for Restricted Permutations
We consider the two permutation statistics which count the distinct pairs obtained from the final two terms of occurrences of patterns 1
Astrid Reifegerste
JCST
2008
85views more  JCST 2008»
13 years 7 months ago
A General Approach to L ( h, k )-Label Interconnection Networks
d Abstract) Tiziana Calamoneri 1 , Saverio Caminiti 2 , and Rossella Petreschi 3 Dipartimento di Informatica Universit`a degli Studi di Roma "La Sapienza" Via Salaria 113...
Tiziana Calamoneri, Saverio Caminiti, Rossella Pet...