3096 search results - page 125 / 620 » Theory and Use of the EM Algorithm |
176
click to vote
ASIAMS
2007
IEEE
15 years 11 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
133
click to vote
ACTA
2006
15 years 4 months ago
2006
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
134
Voted
MLDM
2005
Springer
15 years 10 months ago
2005
Springer
Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. This is a particularly important challenge with...
COLING
2010
14 years 11 months ago
2010
We conduct a series of Part-of-Speech (POS) Tagging experiments using Expectation Maximization (EM), Variational Bayes (VB) and Gibbs Sampling (GS) against the Chinese Penn Treeba...
162
click to vote
RECOMB
2000
Springer
15 years 8 months ago
2000
Springer
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...