Sciweavers

338 search results - page 6 / 68
» On the Complexity of Termination Inference for Processes
Sort
View
ICGI
2004
Springer
15 years 3 months ago
The Omphalos Context-Free Grammar Learning Competition
This paper describes the Omphalos Context-Free Grammar Learning Competition held as part of the International Colloquium on Grammatical Inference 2004. The competition was created ...
Bradford Starkie, François Coste, Menno van...
EPK
2006
114views Management» more  EPK 2006»
14 years 11 months ago
Verifying Properties of (Timed) Event Driven Process Chains by Transformation to Hybrid Automata
Abstract: Event-driven Process Chains (EPCs) are a commonly used modelling technique for design and documentation of business processes. Although EPCs have an easy-to-understand no...
Stefan Denne
JVCIR
2006
79views more  JVCIR 2006»
14 years 9 months ago
Trading off quality and complexity for a HVQ-based video codec on portable devices
Bandwidth and processing requirements of multimedia applications typically exceed capabilities of portable terminals with current technology. Applications should hence be able to ...
Marco Cagnazzo, Francesco Delfino, Luca Vollero, A...
54
Voted
ICIP
2005
IEEE
15 years 11 months ago
Variable module graphs: a framework for inference and learning in modular vision systems
We present a novel and intuitive framework for building modular vision systems for complex tasks such as surveillance applications. Inspired by graphical models, especially factor...
Amit Sethi, Mandar Rahurkar, Thomas S. Huang
AAAI
1998
14 years 11 months ago
Structured Representation of Complex Stochastic Systems
This paperconsidersthe problem of representingcomplex systems that evolve stochastically over time. Dynamic Bayesian networks provide a compact representation for stochastic proce...
Nir Friedman, Daphne Koller, Avi Pfeffer