2040 search results - page 380 / 408 » Approximate Expectation Maximization |
177
Voted
SIGMOD
2008
ACM
16 years 26 days ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
166
Voted
SIGMOD
2007
ACM
16 years 26 days ago
2007
ACM
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
DCC
2004
IEEE
16 years 9 days ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
101
Voted
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
150
click to vote
ALT
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...