1146 search results - page 22 / 230 » Finite cupping sets |
SIAMJO
2008
13 years 7 months ago
2008
Using variational analysis, we study the linear regularity for a collection of finitely many closed sets. In particular, we extend duality characterizations of the linear regularit...
ICDT
2007
ACM
13 years 11 months ago
2007
ACM
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
JCT
2006
13 years 7 months ago
2006
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
INFORMATICALT
2000
13 years 7 months ago
2000
An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new p...
ACSD
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we present two algorithms that effectively synthesize a finite place/transition Petri net (p/t-net) from a finite set of labeled partial orders (a finite partial lang...