Sciweavers

4488 search results - page 141 / 898
» Properties of NP-Complete Sets
Sort
View
GC
2007
Springer
13 years 8 months ago
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
Oswin Aichholzer, Clemens Huemer, S. Kappes, Betti...
APAL
2005
88views more  APAL 2005»
13 years 8 months ago
Completing pseudojump operators
We investigate operators which take a set X to a set relatively computably enumerable in and above X by studying which such sets X can be so mapped into the Turing degree of K. We...
Richard Coles, Rodney G. Downey, Carl G. Jockusch ...
CG
2006
Springer
13 years 8 months ago
G-Strokes: A Concept for Simplifying Line Stylization
In most previous NPR line rendering systems, geometric properties have been directly used to extract and stylize certain edges. However, this approach is bound to a tight stylizat...
Tobias Isenberg, Angela Brennecke
ICFEM
2007
Springer
14 years 2 months ago
Model Checking with SAT-Based Characterization of ACTL Formulas
Bounded semantics of LTL with existential interpretation and that of ECTL (the existential fragment of CTL), and the characterization of these existentially interpreted properties ...
Wenhui Zhang
SSS
2010
Springer
125views Control Systems» more  SSS 2010»
13 years 6 months ago
Systematic Correct Construction of Self-stabilizing Systems: A Case Study
Design and implementation of distributed algorithms often involve many subtleties due to their complex structure, non-determinism, and low atomicity as well as occurrence of unanti...
Ananda Basu, Borzoo Bonakdarpour, Marius Bozga, Jo...