Sciweavers

7150 search results - page 293 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
FORTE
2009
15 years 4 months ago
Approximated Context-Sensitive Analysis for Parameterized Verification
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...
TVCG
2012
201views Hardware» more  TVCG 2012»
13 years 9 months ago
Exact and Approximate Area-Proportional Circular Venn and Euler Diagrams
— Scientists conducting microarray and other experiments use circular Venn and Euler diagrams to analyze and illustrate their results. As one solution to this problem, this artic...
Leland Wilkinson
152
Voted
ICPR
2010
IEEE
16 years 1 months ago
Fast and Accurate Approximation of the Euclidean Opening Function in Arbitrary Dimension
In this paper, we present a fast and accurate approximation of the Euclidean opening function which is a wide-used tool in morphological mathematics to analyze binary shapes since...
David Coeurjolly
ATVA
2005
Springer
130views Hardware» more  ATVA 2005»
16 years 6 days ago
Approximate Reachability for Dead Code Elimination in Esterel
Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel extends Esterel with a noninstantaneous jump instruction (compatible with conc...
Olivier Tardieu, Stephen A. Edwards
162
Voted
COCO
2005
Springer
131views Algorithms» more  COCO 2005»
16 years 6 days ago
On the Hardness of Approximating Multicut and Sparsest-Cut
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuv...