Sciweavers

278 search results - page 24 / 56
» Enumerating Regular Expressions and Their Languages
Sort
View
JMLR
2012
11 years 10 months ago
Bayesian regularization of non-homogeneous dynamic Bayesian networks by globally coupling interaction parameters
To relax the homogeneity assumption of classical dynamic Bayesian networks (DBNs), various recent studies have combined DBNs with multiple changepoint processes. The underlying as...
Marco Grzegorczyk, Dirk Husmeier
CONCUR
2004
Springer
14 years 28 days ago
The Pros and Cons of Netcharts
Netcharts have been introduced recently by Mukund et al. in [17]. This new appealing approach to the specification of collections of message sequence charts (MSCs) benefits from ...
Nicolas Baudru, Rémi Morin
ICALP
2001
Springer
14 years 6 hour ago
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear inequalities. We first show that for any monotone system of r linear inequaliti...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
CAAP
1994
13 years 11 months ago
Some Results on Top-Context-Free Tree Languages
Top-context-free tree languages (called cor gulier by Arnold and Dauchet 1, 2]) constitute a natural subclass of context-free tree languages. In this paper, we give further evidenc...
Dieter Hofbauer, Maria Huber, Gregory Kucherov
VL
2007
IEEE
157views Visual Languages» more  VL 2007»
14 years 1 months ago
Spider Diagrams of Order
Spider diagrams are a visual logic capable of makeing statements about relationships between sets and their cardinalities. Various meta-level results for spider diagrams have been...
Aidan Delaney, Gem Stapleton