94 search results - page 6 / 19 » On Probabilistic Time versus Alternating Time |
CPM
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
QEST
2007
IEEE
14 years 3 months ago
2007
IEEE
We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized Ctl (Qrctl): formulas o...
IM
2003
13 years 10 months ago
2003
Abstract: A probabilistic event-driven fault localization technique is presented, which uses a symptom-fault map as a fault propagation model. The technique isolates the most proba...
ICASSP
2011
IEEE
13 years 21 days ago
2011
IEEE
We significantly improve the computational efficiency of a probabilistic approach for multiple pitch tracking. This method is based on a factorial hidden Markov model and two al...
ICPR
2004
IEEE
14 years 10 months ago
2004
IEEE
The maximum entropy principle is a cornerstone of FRAME (Filters, RAndom fields, and Maximum Entropy) model considered at times as a first-ever step towards a universal theory of ...