1059 search results - page 29 / 212 » Improved Algorithms via Approximations of Probability Distri... |
103
click to vote
AAAI
2012
13 years 1 days ago
2012
We consider lifted importance sampling (LIS), a previously proposed approximate inference algorithm for statistical relational learning (SRL) models. LIS achieves substantial vari...
113
click to vote
ICNSC
2007
IEEE
15 years 4 months ago
2007
IEEE
The paper addresses object localization via a distributed sensor network. A centralized estimation approach is undertaken along with a selective node activation strategy to ensure...
ATAL
2009
Springer
15 years 1 months ago
2009
Springer
Interactive dynamic influence diagrams (I-DIDs) are graphical models for sequential decision making in uncertain settings shared by other agents. Algorithms for solving I-DIDs fac...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...