Sciweavers

518 search results - page 9 / 104
» Estimating Missing Data in Data Streams
Sort
View
RECSYS
2009
ACM
14 years 4 months ago
Collaborative prediction and ranking with non-random missing data
A fundamental aspect of rating-based recommender systems is the observation process, the process by which users choose the items they rate. Nearly all research on collaborative ...
Benjamin M. Marlin, Richard S. Zemel
INTERSPEECH
2010
13 years 4 months ago
Mask estimation in non-stationary noise environments for missing feature based robust speech recognition
In missing feature based automatic speech recognition (ASR), the role of the spectro-temporal mask in providing an accurate description of the relationship between target speech a...
Shirin Badiezadegan, Richard C. Rose
CSL
2007
Springer
13 years 9 months ago
On noise masking for automatic missing data speech recognition: A survey and discussion
Automatic speech recognition (ASR) has reached very high levels of performance in controlled situations. However, the performance degrades significantly when environmental noise ...
Christophe Cerisara, Sébastien Demange, Jea...
ICIP
2000
IEEE
14 years 11 months ago
Curve Evolution, Boundary-Value Stochastic Processes, the Mumford-Shah Problem, and Missing Data Applications
We present an estimation-theoretic approach to curve evolution for the Mumford-Shah problem. By viewing an active contour as the set of discontinuities in the Mumford-Shah problem...
Andy Tsai, Anthony J. Yezzi, Alan S. Willsky
APPROX
2004
Springer
108views Algorithms» more  APPROX 2004»
14 years 3 months ago
Estimating Frequency Moments of Data Streams Using Random Linear Combinations
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
Sumit Ganguly