Sciweavers

924 search results - page 32 / 185
» Incremental Probabilistic Inference
Sort
View
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
14 years 4 months ago
Better Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
Marek Chrobak, Mathilde Hurand
AI
2006
Springer
14 years 1 months ago
An Improved LAZY-AR Approach to Bayesian Network Inference
We propose LAZY arc-reversal with variable elimination (LAZY-ARVE) as a new approach to probabilistic inference in Bayesian networks (BNs). LAZY-ARVE is an improvement upon LAZY ar...
Cory J. Butz, Shan Hua
ICML
2010
IEEE
13 years 11 months ago
Forgetting Counts: Constant Memory Inference for a Dependent Hierarchical Pitman-Yor Process
We propose a novel dependent hierarchical Pitman-Yor process model for discrete data. An incremental Monte Carlo inference procedure for this model is developed. We show that infe...
Nicholas Bartlett, David Pfau, Frank Wood
ICML
2009
IEEE
14 years 4 months ago
Grammatical inference as a principal component analysis problem
One of the main problems in probabilistic grammatical inference consists in inferring a stochastic language, i.e. a probability distribution, in some class of probabilistic models...
Raphaël Bailly, François Denis, Liva R...
SSDBM
2007
IEEE
105views Database» more  SSDBM 2007»
14 years 4 months ago
Maintaining K-Anonymity against Incremental Updates
K-anonymity is a simple yet practical mechanism to protect privacy against attacks of re-identifying individuals by joining multiple public data sources. All existing methods achi...
Jian Pei, Jian Xu, Zhibin Wang, Wei Wang 0009, Ke ...