Sciweavers

2496 search results - page 246 / 500
» On covering by translates of a set
Sort
View
JCT
2011
74views more  JCT 2011»
15 years 1 months ago
Basis theorems for continuous n-colorings
This article is devoted to the study of continuous colorings of the n-element subsets of a Polish space. The homogeneity number hm(c) of an n-coloring c : [X]n → 2 is the least s...
Stefanie Frick, Stefan Geschke
NETWORKS
2011
15 years 1 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
NFM
2011
225views Formal Methods» more  NFM 2011»
15 years 1 months ago
Synthesis for PCTL in Parametric Markov Decision Processes
Abstract. In parametric Markov Decision Processes (PMDPs), transition probabilities are not fixed, but are given as functions over a set of parameters. A PMDP denotes a family of ...
Ernst Moritz Hahn, Tingting Han, Lijun Zhang
RSA
2011
89views more  RSA 2011»
15 years 1 months ago
Excluding induced subgraphs: Critical graphs
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...
József Balogh, Jane Butterfield
202
Voted
CORR
2011
Springer
179views Education» more  CORR 2011»
15 years 1 months ago
Recovery of Sparsely Corrupted Signals
We investigate the recovery of signals exhibiting a sparse representation in a general (i.e., possibly redundant or incomplete) dictionary that are corrupted by additive noise adm...
Christoph Studer, Patrick Kuppinger, Graeme Pope, ...