Sciweavers

1146 search results - page 28 / 230
» Finite cupping sets
Sort
View
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 7 months ago
On Omega Context Free Languages which are Borel Sets of Infinite Rank
This paper is a continuation of the study of topological properties of omega context free languages (-CFL). We proved in [Topological Properties of Omega Context Free Languages, T...
Olivier Finkel
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
13 years 12 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
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...
IPL
2008
84views more  IPL 2008»
13 years 7 months ago
The equational theory of prebisimilarity over basic CCS with divergence
This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduced by Hennessy and Milner in the early 1980s, over basic CCS with the divergent ...
Luca Aceto, Silvio Capobianco, Anna Ingólfs...
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 7 months ago
Minimizing Symmetric Set Functions Faster
We describe a combinatorial algorithm which, given a monotone and consistent symmetric set function d on a finite set V in the sense of Rizzi [Riz00], constructs a non trivial set...
Michael Brinkmeier