Sciweavers

1716 search results - page 169 / 344
» Proving Conditional Termination
Sort
View
92
Voted
MCSS
2006
Springer
15 years 20 days ago
A lattice approach to analysis and synthesis problems
Within a lattice approach, the purpose of this paper is to give general necessary and sufficient conditions for internal stabilizability and for the existence of (weakly) left-/rig...
Alban Quadrat
92
Voted
FUIN
2007
86views more  FUIN 2007»
15 years 20 days ago
Advances in Symmetric Sandpiles
A symmetric version of the well-known SPM model for sandpiles is introduced. We prove that the new model has fixed point dynamics. Although there might be several fixed points, ...
Enrico Formenti, Benoît Masson, Theophilos P...
90
Voted
SIAMDM
2008
123views more  SIAMDM 2008»
15 years 19 days ago
Adapted List Coloring of Graphs and Hypergraphs
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than thes...
Alexandr V. Kostochka, Xuding Zhu
101
Voted
SIAMIS
2008
82views more  SIAMIS 2008»
15 years 19 days ago
Inpainting by Flexible Haar-Wavelet Shrinkage
We present novel wavelet-based inpainting algorithms. Applying ideas from anisotropic regularization and diffusion our models can better handle degraded pixels at edges. We interp...
R. H. Chan, Simon Setzer, Gabriele Steidl
94
Voted
ARSCOM
2005
98views more  ARSCOM 2005»
15 years 19 days ago
Supereulerian planar graphs
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...
Hong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan ...