Rina Dechter | DeepAI

DeepAI AI Chat

Featured Co-authors

Judea Pearl
53 publications
Irina Rish
51 publications
Thomas S. Richardson
23 publications
Vibhav Gogate
15 publications
Radu Marinescu
13 publications
Alexander Ihler
11 publications
Alexander T. Ihler
11 publications
Robert Mateescu
7 publications
Kalev Kask
6 publications
Bozhena Bidyuk
4 publications
Andrew E. Gelfand
3 publications

∙ 08/31/2023

Boosting AND/OR-Based Computational Protein Design: Dynamic Heuristics and Generalizable UFO

Scientific computing has experienced a surge empowered by advancements i...

0 Bobak Pezeshki, et al. ∙

∙ 01/16/2014

Active Tuples-based Scheme for Bounding Posterior Beliefs

The paper presents a scheme for computing lower and upper bounds on the ...

0 Bozhena Bidyuk, et al. ∙

∙ 01/15/2014

Join-Graph Propagation Algorithms

The paper investigates parameterized approximate message-passing schemes...

0 Robert Mateescu, et al. ∙

∙ 01/15/2014

AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models

Inspired by the recently introduced framework of AND/OR search spaces fo...

0 Robert Mateescu, et al. ∙

∙ 02/13/2013

Identifying Independencies in Causal Graphs with Feedback

We show that the d -separation criterion constitutes a valid test for co...

0 Judea Pearl, et al. ∙

∙ 02/13/2013

An Evaluation of Structural Parameters for Probabilistic Reasoning: Results on Benchmark Circuits

Many algorithms for processing probabilistic networks are dependent on t...

0 Yousri El Fattah, et al. ∙

∙ 02/13/2013

Topological Parameters for Time-Space Tradeoff

In this paper we propose a family of algorithms combining tree-clusterin...

0 Rina Dechter, et al. ∙

∙ 02/13/2013

Bucket Elimination: A Unifying Framework for Several Probabilistic Inference

Probabilistic inference algorithms for finding the most probable explana...

0 Rina Dechter, et al. ∙

∙ 02/06/2013

A Scheme for Approximating Probabilistic Inference

This paper describes a class of probabilistic approximation algorithms b...

0 Rina Dechter, et al. ∙

∙ 01/30/2013

Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding

It was recently shown that the problem of decoding messages transmitted ...

0 Irina Rish, et al. ∙

∙ 01/23/2013

Mini-Bucket Heuristics for Improved Search

The paper is a second in a series of two papers evaluating the power of ...

0 Kalev Kask, et al. ∙

∙ 01/10/2013

Hybrid Processing of Beliefs and Constraints

This paper explores algorithms for processing probabilistic and determin...

0 Rina Dechter, et al. ∙

∙ 12/12/2012

Iterative Join-Graph Propagation

The paper presents an iterative version of join-tree clustering that app...

0 Rina Dechter, et al. ∙

∙ 10/19/2012

Systematic vs. Non-systematic Algorithms for Solving the MPE Task

The paper continues the study of partitioning based inference of heurist...

0 Radu Marinescu, et al. ∙

∙ 10/19/2012

A Simple Insight into Iterative Belief Propagation's Success

In Non - ergodic belief networks the posterior belief OF many queries gi...

0 Rina Dechter, et al. ∙

∙ 10/19/2012

An Empirical Study of w-Cutset Sampling for Bayesian Networks

The paper studies empirically the time-space trade-off between sampling ...

0 Bozhena Bidyuk, et al. ∙

∙ 10/16/2012

A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models

We study the problem of complexity estimation in the context of parallel...

0 Lars Otten, et al. ∙

∙ 10/16/2012

Join-graph based cost-shifting schemes

We develop several algorithms taking advantage of two common approaches ...

0 Alexander T. Ihler, et al. ∙

∙ 08/25/2012

Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (2006)

This is the Proceedings of the Twenty-Second Conference on Uncertainty i...

0 Rina Dechter, et al. ∙

∙ 07/11/2012

On finding minimal w-cutset

The complexity of a reasoning task over a graphical model is tied to the...

0 Bozhena Bidyuk, et al. ∙

∙ 07/11/2012

Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space

The paper introduces mixed networks, a new framework for expressing and ...

0 Rina Dechter, et al. ∙

∙ 07/11/2012

A Complete Anytime Algorithm for Treewidth

In this paper, we present a Branch and Bound algorithm called QuickBB fo...

0 Vibhav Gogate, et al. ∙

∙ 07/04/2012

The Relationship Between AND/OR Search and Variable Elimination

In this paper we compare search and inference in graphical models throug...

0 Robert Mateescu, et al. ∙

∙ 07/04/2012

Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints

In this paper, we consider Hybrid Mixed Networks (HMN) which are Hybrid ...

0 Vibhav Gogate, et al. ∙

∙ 07/04/2012

Modeling Transportation Routines using Hybrid Dynamic Mixed Networks

This paper describes a general framework called Hybrid Dynamic Mixed Net...

0 Vibhav Gogate, et al. ∙

∙ 06/13/2012

Bounding Search Space Size via (Hyper)tree Decompositions

This paper develops a measure for bounding the performance of AND/OR sea...

0 Lars Otten, et al. ∙

∙ 06/13/2012

AND/OR Importance Sampling

The paper introduces AND/OR importance sampling for probabilistic graphi...

0 Vibhav Gogate, et al. ∙

∙ 03/15/2012

BEEM : Bucket Elimination with External Memory

A major limitation of exact inference algorithms for probabilistic graph...

0 Kalev Kask, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world