Sciweavers

301 search results - page 22 / 61
» Probabilistic rough set approximations
Sort
View
NIPS
2001
13 years 9 months ago
Latent Dirichlet Allocation
We describe latent Dirichlet allocation (LDA), a generative probabilistic model for collections of discrete data such as text corpora. LDA is a three-level hierarchical Bayesian m...
David M. Blei, Andrew Y. Ng, Michael I. Jordan
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
14 years 1 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...
VMV
2004
165views Visualization» more  VMV 2004»
13 years 9 months ago
Fast and Accurate Ray-Voxel Intersection Techniques for Iso-Surface Ray Tracing
Visualizing iso-surfaces of volumetric data sets is becoming increasingly important for many practical applications. One crucial task in iso-surface ray tracing is to find the cor...
Gerd Marmitt, Andreas Kleer, Ingo Wald, Heiko Frie...
EDBT
2012
ACM
224views Database» more  EDBT 2012»
11 years 10 months ago
Aggregate queries on probabilistic record linkages
Record linkage analysis, which matches records referring to the same real world entities from different data sets, is an important task in data integration. Uncertainty often exi...
Ming Hua, Jian Pei
DFG
2009
Springer
14 years 2 months ago
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz,...