Sciweavers

1208 search results - page 55 / 242
» On Counting Generalized Colorings
Sort
View
ICIAR
2007
Springer
14 years 3 months ago
Parameterless Discrete Regularization on Graphs for Color Image Filtering
A discrete regularization framework on graphs is proposed and studied for color image filtering purposes when images are represented by grid graphs. Image filtering is considered...
Olivier Lezoray, Sébastien Bougleux, Abderr...
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
13 years 10 months ago
Fast mixing for independent sets, colorings and other models on trees
We study the mixing time of the Glauber dynamics for general spin systems on bounded-degree trees, including the Ising model, the hard-core model (independent sets) and the antife...
Fabio Martinelli, Alistair Sinclair, Dror Weitz
PRL
2010
112views more  PRL 2010»
13 years 7 months ago
Reversible color-to-gray mapping using subband domain texturization
— The concept of reversible conversion of color images to gray ones has been recently introduced. Colors are mapped to textures and from the textures the receiver can recover the...
Ricardo L. de Queiroz
IPL
2008
89views more  IPL 2008»
13 years 9 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
CC
2010
Springer
155views System Software» more  CC 2010»
14 years 3 months ago
Preference-Guided Register Assignment
Abstract. This paper deals with coalescing in SSA-based register allocation. Current coalescing techniques all require the interference graph to be built. This is generally conside...
Matthias Braun, Christoph Mallon, Sebastian Hack