338 search results - page 26 / 68 » On the Complexity of Termination Inference for Processes |
86
Voted
FLAIRS
2006
14 years 11 months ago
2006
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
JAR
2006
14 years 9 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
114
click to vote
CVPR
2012
IEEE
13 years 2 days ago
2012
IEEE
This paper addresses the discovery of activities and learns the underlying processes that govern their occurrences over time in complex surveillance scenes. To this end, we propos...
119
click to vote
IS
2008
14 years 9 months ago
2008
In this paper we propose DFL -- a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated, and the structure of the ...
171
click to vote
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
Keyword search enables web users to easily access XML data without the need to learn a structured query language and to study possibly complex data schemas. Existing work has addr...