Sciweavers

356 search results - page 20 / 72
» Submodular Approximation: Sampling-based Algorithms and Lowe...
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
JAIR
2011
114views more  JAIR 2011»
12 years 10 months ago
Properties of Bethe Free Energies and Message Passing in Gaussian Models
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
Botond Cseke, Tom Heskes
JCO
2010
169views more  JCO 2010»
13 years 6 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
IDA
2007
Springer
13 years 7 months ago
Approximate mining of frequent patterns on streams
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
Claudio Silvestri, Salvatore Orlando
AAIM
2006
Springer
110views Algorithms» more  AAIM 2006»
14 years 1 months ago
Non-metric Multicommodity and Multilevel Facility Location
Abstract. We give logarithmic approximation algorithms for the nonmetric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal u...
Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu