Sciweavers

2496 search results - page 159 / 500
» On covering by translates of a set
Sort
View
COMBINATORICS
2007
74views more  COMBINATORICS 2007»
15 years 6 months ago
Bipartite-Uniform Hypermaps on the Sphere
A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that “neighbouring” hypervertices have different colours. It is bipartiteuniform i...
Antonio Breda d'Azevedo, Rui Duarte
STACS
1999
Springer
15 years 10 months ago
The Weakness of Self-Complementation
Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, procee...
Orna Kupferman, Moshe Y. Vardi
CORR
2006
Springer
108views Education» more  CORR 2006»
15 years 6 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
FSTTCS
2010
Springer
15 years 4 months ago
Parityizing Rabin and Streett
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...
Udi Boker, Orna Kupferman, Avital Steinitz
ILP
2003
Springer
15 years 11 months ago
Disjunctive Learning with a Soft-Clustering Method
In the case of concept learning from positive and negative examples, it is rarely possible to find a unique discriminating conjunctive rule; in most cases, a disjunctive descripti...
Guillaume Cleuziou, Lionel Martin, Christel Vrain