Sciweavers

4860 search results - page 119 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
NIPS
2004
15 years 5 months ago
VDCBPI: an Approximate Scalable Algorithm for Large POMDPs
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
Pascal Poupart, Craig Boutilier
DATE
2005
IEEE
131views Hardware» more  DATE 2005»
15 years 10 months ago
Unified Modeling of Complex Real-Time Control Systems
Complex real-time control system is a software dense and algorithms dense system, which needs modern software engineering techniques to design. UML is an object-oriented industria...
He Hai, Zhong Yi-fang, Cai Chi-lan
ADBIS
2000
Springer
111views Database» more  ADBIS 2000»
15 years 8 months ago
Discovering Frequent Episodes in Sequences of Complex Events
Data collected in many applications have a form of sequences of events. One of the popular data mining problems is discovery of frequently occurring episodes in such sequences. Eff...
Marek Wojciechowski
PLANX
2008
15 years 5 months ago
Complexity of Earliest Query Answering with Streaming Tree Automata
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
Olivier Gauwin, Anne-Cécile Caron, Joachim ...
AIIA
2007
Springer
15 years 10 months ago
Structured Hidden Markov Model: A General Framework for Modeling Complex Sequences
Structured Hidden Markov Model (S-HMM) is a variant of Hierarchical Hidden Markov Model that shows interesting capabilities of extracting knowledge from symbolic sequences. In fact...
Ugo Galassi, Attilio Giordana, Lorenza Saitta