Sciweavers

4894 search results - page 855 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
BMVC
2002
13 years 10 months ago
Randomized RANSAC with T(d, d) test
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...
Jiri Matas, Ondrej Chum
AAAI
2008
13 years 10 months ago
A General Framework for Generating Multivariate Explanations in Bayesian Networks
Many existing explanation methods in Bayesian networks, such as Maximum a Posteriori (MAP) assignment and Most Probable Explanation (MPE), generate complete assignments for target...
Changhe Yuan, Tsai-Ching Lu
AAAI
2007
13 years 10 months ago
Partial Revelation Automated Mechanism Design
In most mechanism design settings, optimal general-purpose mechanisms are not known. Thus the automated design of mechanisms tailored to specific instances of a decision scenario...
Nathanael Hyafil, Craig Boutilier
AAAI
2007
13 years 10 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...
AAAI
2007
13 years 10 months ago
COD: Online Temporal Clustering for Outbreak Detection
We present Cluster Onset Detection (COD), a novel algorithm to aid in detection of epidemic outbreaks. COD employs unsupervised learning techniques in an online setting to partiti...
Tomás Singliar, Denver Dash