Sciweavers

985 search results - page 72 / 197
» Piercing Convex Sets
Sort
View
TPHOL
2005
IEEE
14 years 3 months ago
Mechanized Metatheory for the Masses: The PoplMark Challenge
Abstract. How close are we to a world where every paper on programming languages is accompanied by an electronic appendix with machinechecked proofs? We propose an initial set of b...
Brian E. Aydemir, Aaron Bohannon, Matthew Fairbair...
PLANX
2008
13 years 11 months ago
Linear Time Membership for a Class of XML Types with Interleaving and Counting
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
IPMU
2010
Springer
14 years 2 months ago
Credal Sets Approximation by Lower Probabilities: Application to Credal Networks
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
Alessandro Antonucci, Fabio Cuzzolin
JMIV
2010
98views more  JMIV 2010»
13 years 8 months ago
Expectations of Random Sets and Their Boundaries Using Oriented Distance Functions
Shape estimation and object reconstruction are common problems in image analysis. Mathematically, viewing objects in the image plane as random sets reduces the problem of shape es...
Hanna K. Jankowski, Larissa I. Stanberry
SIAMJO
2010
108views more  SIAMJO 2010»
13 years 8 months ago
Exposed Faces of Semidefinitely Representable Sets
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine linear combinations of variables is positive semidefinite. Motivated by th...
Tim Netzer, Daniel Plaumann, Markus Schweighofer