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...
We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized Ctl (Qrctl): formulas o...
Luca de Alfaro, Krishnendu Chatterjee, Marco Faell...
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...
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...
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 ...
Georgy L. Gimel'farb, Luc J. Van Gool, Alexey Zale...