Sciweavers

16 search results - page 1 / 4
» Memory bounded inference in topic models
Sort
View
ICML
2008
IEEE
14 years 5 months ago
Memory bounded inference in topic models
What type of algorithms and statistical techniques support learning from very large datasets over long stretches of time? We address this question through a memory bounded version...
Ryan Gomes, Max Welling, Pietro Perona
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 5 months ago
Efficient methods for topic model inference on streaming document collections
Topic models provide a powerful tool for analyzing large text collections by representing high dimensional data in a low dimensional subspace. Fitting a topic model given a set of...
Limin Yao, David M. Mimno, Andrew McCallum
ICASSP
2010
IEEE
13 years 5 months ago
Supervised topic model for automatic image annotation
This paper presents a new probabilistic model for the task of image annotation. Our model, which we call sLDA-bin, extends supervised Latent Dirichlet Allocation (sLDA) model to h...
Duangmanee Putthividhya, Hagai Thomas Attias, Srik...
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
13 years 6 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 5 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...