SIGN IN
SIGN UP
Mini-buckets: A general scheme for bounded inference
Full Text:
PDF
Buy this Article
Authors:
Rina Dechter
University of California, Irvine, Irvine, California
Irina Rish
IBM T. J. Watson Research Center, Hawthorne, New York
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 50 Issue 2, March 2003
Pages 107-153
ACM
New York, NY
, USA
table of contents
doi>
10.1145/636865.636866
2003 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 25
· Downloads (cumulative): 1,027
· Citation Count: 38
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
accuracy/complexity trade-off
algorithms
approximation algorithms
bayesian networks
combinatorial optimization
experimentation
optimization
probabilistic inference.
tradeoffs among complexity measures
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder