Sciweavers

1208 search results - page 11 / 242
» On Counting Generalized Colorings
Sort
View
SODA
2003
ACM
138views Algorithms» more  SODA 2003»
15 years 1 months ago
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs
Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n, r) of middle-state switches for the symmetric 3-stage Clos network C(n, m(n, r), r) to be rearr...
Hung Q. Ngo, Van H. Vu
IJCV
2010
110views more  IJCV 2010»
14 years 10 months ago
Generalized Gamut Mapping using Image Derivative Structures for Color Constancy
Arjan Gijsenij, Theo Gevers, Joost van de Weijer
FOCS
2006
IEEE
15 years 5 months ago
A simple condition implying rapid mixing of single-site dynamics on spin systems
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
Thomas P. Hayes
COCOON
2008
Springer
15 years 1 months ago
Polychromatic Colorings of n-Dimensional Guillotine-Partitions
A strong hyperbox-respecting coloring of an n-dimensional hyperbox partition is a coloring of the corners of its hyperboxes with 2n colors such that any hyperbox has all the colors...
Balázs Keszegh
COMBINATORICS
2007
74views more  COMBINATORICS 2007»
14 years 11 months ago
Statistics on the Multi-Colored Permutation Groups
We define an excedance number for the multi-colored permutation group i.e. the wreath product (Zr1 × · · · × Zrk ) Sn and calculate its multi-distribution with some natural ...
Eli Bagno, Ayelet Butman, David Garber