activity
20022014
most citedEfficient Approximation for Triangulation of Minimum Treewidth

130 citations · 309 across the 8 of their papers we have counts for

collaborators

8 papers

cs.AI2014★ 120 cited

Learning Partially Observable Deterministic Action Models

Eyal Amir, Allen Chang

We present exact algorithms for identifying deterministic-actions effects and preconditions in dynamic partially observable domains. They apply when one does not know the action mo…

cs.DS2013★ 130 cited

Efficient Approximation for Triangulation of Minimum Treewidth

Eyal Amir

We present four novel approximation algorithms for finding triangulation of minimum treewidth. Two of the algorithms improve on the running times of algorithms by Robertson and Sey…

cs.LG2012★ 11 cited

Lifted Relational Variational Inference

Jaesik Choi, Eyal Amir

Hybrid continuous-discrete models naturally represent many real-world applications in robotics, finance, and environmental engineering. Inference with large-scale models is challen…

cs.DS2012★ 1 cited

Reachability Under Uncertainty

Allen Chang, Eyal Amir

In this paper we introduce a new network reachability problem where the goal is to find the most reliable path between two nodes in a network, represented as a directed acyclic gra…

cs.AI2012★ 12 cited

Sampling First Order Logical Particles

Hannaneh Hajishirzi, Eyal Amir

Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fun…

cs.AI2012★ 23 cited

Lifted Inference for Relational Continuous Models

Jaesik Choi, Eyal Amir, David J. Hill

Relational Continuous Models (RCMs) represent joint probability densities over attributes of objects, when the attributes have continuous domains. With relational representations,…