Sciweavers

301 search results - page 35 / 61
» Probabilistic rough set approximations
Sort
View
AAAI
2010
13 years 9 months ago
New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
Emma Rollon, Rina Dechter
NECO
1998
121views more  NECO 1998»
13 years 7 months ago
Nonlinear Time-Series Prediction with Missing and Noisy Data
We derive solutions for the problem of missing and noisy data in nonlinear timeseries prediction from a probabilistic point of view. We discuss different approximations to the so...
Volker Tresp, Reimar Hofmann
JMLR
2010
164views more  JMLR 2010»
13 years 2 months ago
Solving the Uncapacitated Facility Location Problem Using Message Passing Algorithms
The Uncapacitated Facility Location Problem (UFLP) is one of the most widely studied discrete location problems, whose applications arise in a variety of settings. We tackle the U...
Nevena Lazic, Brendan J. Frey, Parham Aarabi
CVPR
2009
IEEE
15 years 2 months ago
Simultaneous Image Classification and Annotation
Image classification and annotation are important problems in computer vision, but rarely considered together. Intuitively, annotations provide evidence for the class label, and...
Chong Wang, David M. Blei, Fei-Fei Li
FSTTCS
2007
Springer
14 years 1 months ago
"Rent-or-Buy" Scheduling and Cost Coloring Problems
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
Takuro Fukunaga, Magnús M. Halldórss...