Sciweavers

4103 search results - page 137 / 821
» Some results on the Collatz problem
Sort
View
ICASSP
2008
IEEE
16 years 1 months ago
Satellite image reconstruction from an irregular sampling
We propose a new method to solve a problem of image restoration with many different aspects: reconstruction from irregular samples, deconvolution and denoising. The model we propo...
Eric Bughin, Laure Blanc-Féraud, Josiane Ze...
APN
2005
Springer
16 years 4 days ago
Continuization of Timed Petri Nets: From Performance Evaluation to Observation and Control
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models allowing more...
Manuel Silva, Laura Recalde
FOCS
2006
IEEE
16 years 19 days ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
JGAA
2006
83views more  JGAA 2006»
15 years 6 months ago
On the approximation of Min Split-coloring and Min Cocoloring
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
Marc Demange, Tinaz Ekim, Dominique de Werra
CP
2009
Springer
16 years 7 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný