A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e., s...
In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and...
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction ...
Kalev Kask, Rina Dechter, Javier Larrosa, Avi Dech...
This poster session examines a probabilistic approach to distributed information retrieval using a Logistic Regression algorithm for estimation of collection relevance. The algori...
Abstract. This study presents developed algorithm for assessment and updating estimates of parameters in the mathematical models of non-stationary processes (for instance, system a...
Inga Zutautaite-Seputiene, Juozas Augutis, Laimuti...