Sciweavers

985 search results - page 38 / 197
» Piercing Convex Sets
Sort
View
SAS
2005
Springer
132views Formal Methods» more  SAS 2005»
14 years 1 months ago
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
Roberto Bagnara, Enric Rodríguez-Carbonell,...
TIT
2011
116views more  TIT 2011»
13 years 2 months ago
Convex Programming Upper Bounds on the Capacity of 2-D Constraints
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
Ido Tal, Ron M. Roth
ECAI
2008
Springer
13 years 9 months ago
Generating Diagnoses from Conflict Sets with Continuous Attributes
Abstract. Many techniques in model-based diagnosis and other research fields find the hitting sets of a group of sets. Existing techniques apply to sets of finite elements only. Th...
Emmanuel Benazera, Louise Travé-Massuy&egra...
FUZZIEEE
2007
IEEE
14 years 2 months ago
On Complete Sublattices of the Algebra of Truth Values of Type-2 Fuzzy Sets
— The algebra of truth values of type-2 fuzzy sets contains isomorphic copies of the algebra of truth values of type1 fuzzy sets and the algebra of truth values of interval-value...
John Harding, Carol L. Walker, Elbert A. Walker
COMGEO
2006
ACM
13 years 7 months ago
A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
Simone Klenk, Volker Schmidt, Evgueni Spodarev