Sciweavers

1208 search results - page 56 / 242
» On Counting Generalized Colorings
Sort
View
LCTRTS
2007
Springer
14 years 3 months ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue
JVCIR
2006
104views more  JVCIR 2006»
13 years 9 months ago
Color image decomposition and restoration
Meyer has recently introduced an image decomposition model to split an image into two components: a geometrical component and a texture (oscillatory) component. Inspired by his wo...
Jean-François Aujol, Sung Ha Kang
SIAMIS
2010
109views more  SIAMIS 2010»
13 years 3 months ago
Application of the Topological Gradient Method to Color Image Restoration
The goal of this note is to generalize the topological gradient method, applied to restoration and classification problems for grey-level images, to color images. We illustrate ou...
Didier Auroux, Lamia Jaafar Belaid, Badreddine Rja...
TSMC
2010
13 years 3 months ago
A Novel Colored Fluid Stochastic Petri Net Simulation Model for Reliability Evaluation of Wind/PV/Diesel Small Isolated Power Sy
This paper introduces a new general methodology for the modeling and reliability evaluation of small isolated power systems, which include wind turbines, photovoltaics, and diesel ...
Yiannis A. Katsigiannis, Pavlos S. Georgilakis, Ge...
COCOON
2007
Springer
14 years 3 months ago
On the Number of Cycles in Planar Graphs
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
Kevin Buchin, Christian Knauer, Klaus Kriegel, And...