Sciweavers

3096 search results - page 198 / 620
» The Generalized FITC Approximation
Sort
View
165
Voted
PAMI
2008
145views more  PAMI 2008»
15 years 5 months ago
Latent-Space Variational Bayes
Variational Bayesian Expectation-Maximization (VBEM), an approximate inference method for probabilistic models based on factorizing over latent variables and model parameters, has ...
JaeMo Sung, Zoubin Ghahramani, Sung Yang Bang
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 5 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
16 years 5 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
145
Voted
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 11 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
WSC
2007
15 years 7 months ago
Estimating the probability of a rare event over a finite time horizon
We study an approximation for the zero-variance change of measure to estimate the probability of a rare event in a continuous-time Markov chain. The rare event occurs when the cha...
Pieter-Tjerk de Boer, Pierre L'Ecuyer, Gerardo Rub...