| Document Date: 2009-08-13 03:47:05
Open Document File Size: 548,71 KBShare Result on Facebook
City San Francisco / San Jose / / Company Bayer / Kellogg / Intel Corporation / / Facility University of Groningen / / IndustryTerm branch-and-bound algorithms / dichotomy algorithm / local search heuristics / diagnostic belief networks / approximation algorithms / energy / systematic search / active data mining / sensor networks / randomized algorithm / polynomial time algorithm / greedy algorithm / recent constant-factor approximation algorithms / online performance guarantee / online performance guarantees / wireless temperature sensors / computing / randomized approximation algorithms / constantfactor approximation algorithms / real-world systems / proximation algorithms / observation selection algorithm / large-scale resource-constrained systems / sensor network / / NaturalFeature San Francisco Bay / / Organization American Statistical Association / UC Berkeley / U.S. Securities and Exchange Commission / Carnegie Mellon University / University of Groningen / / Person Testset / Brigham Anderson / Carlos Guestrin Carnegie / Andrew Moore / Tommi Jaakkola / Figure / / / Position model / Second highway model / Graphical model / / ProgrammingLanguage K / L / / PublishedMedium Journal of the ACM / Journal of the American Statistical Association / / Technology end Algorithm / constantfactor approximation algorithms / polynomial time algorithm / proximation algorithms / randomized approximation algorithms / dichotomy algorithm / sampling algorithm / Approximation algorithm / observation selection algorithm / greedy algorithm / conditional entropies The algorithms / approximation algorithms / data mining / dom / 4 Approximation algorithms / branch-and-bound algorithms / recent constant-factor approximation algorithms / / URL http /
SocialTag |
Near-optimal Nonmyopic Value of Information in Graphical Models Andreas Krause Carnegie Mellon University Abstract