Just Count the Satisfied Groundings: Scalable Local-Search and Sampling Based Inference in MLNs | Zendy

Deepak Venugopal | Zendy; Somdeb Sarkhel | Zendy; Vibhav Gogate | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Just Count the Satisfied Groundings: Scalable Local-Search and Sampling Based Inference in MLNs

Author(s) -

Deepak Venugopal,

Somdeb Sarkhel,

Vibhav Gogate

Publication year - 2015

Publication title -

proceedings of the aaai conference on artificial intelligence

Language(s) - English

Resource type - Journals

eISSN - 2374-3468

pISSN - 2159-5399

DOI - 10.1609/aaai.v29i1.9676

Subject(s) - bottleneck , inference , scalability , computer science , sampling (signal processing) , gibbs sampling , tree (set theory) , computational complexity theory , constraint satisfaction problem , constraint satisfaction , theoretical computer science , algorithm , graphical model , markov chain , tree traversal , search tree , constraint (computer aided design) , mathematical optimization , mathematics , search algorithm , artificial intelligence , machine learning , mathematical analysis , bayesian probability , geometry , filter (signal processing) , database , probabilistic logic , computer vision , embedded system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research