920 search results - page 78 / 184 » Computing the Frequency of Partial Orders |
100
click to vote
CONCUR
1999
Springer
15 years 2 months ago
1999
Springer
We present several interpretations of the behavior of P/T nets in terms of traces, event structures, and partial orders. Starting from results of Hoogers, Kleijn and Thiagarajan, w...
105
click to vote
CONSTRAINTS
2010
14 years 7 months ago
2010
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
FUIN
2007
14 years 9 months ago
2007
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
AUTOMATICA
2010
14 years 8 months ago
2010
When a phenomenon is described by a parametric model and multiple datasets are available, a key problem in statistics is to discover which datasets are characterized by the same p...
122
click to vote
SDM
2010
SIAM
14 years 11 months ago
2010
SIAM
Given a collection of Boolean spatio-temporal(ST) event types, the cascading spatio-temporal pattern (CSTP) discovery process finds partially ordered subsets of event-types whose ...