Sciweavers

5785 search results - page 351 / 1157
» Approximability of Probability Distributions
Sort
View
130
Voted
KDD
2004
ACM
156views Data Mining» more  KDD 2004»
16 years 5 months ago
TiVo: making show recommendations using a distributed collaborative filtering architecture
We describe the TiVo television show collaborative recommendation system which has been fielded in over one million TiVo clients for four years. Over this install base, TiVo curre...
Kamal Ali, Wijnand van Stam

Book
376views
17 years 2 months ago
An Exploration of Random Processes for Engineers
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
Bruce Hajek
156
Voted
UAI
2001
15 years 6 months ago
Maximum Likelihood Bounded Tree-Width Markov Networks
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
Nathan Srebro
ICASSP
2009
IEEE
15 years 11 months ago
Extended VTS for noise-robust speech recognition
Model compensation is a standard way of improving the robustness of speech recognition systems to noise. A number of popular schemes are based on vector Taylor series (vts) compen...
Rogier C. van Dalen, Mark J. F. Gales
ICDCS
2006
IEEE
15 years 11 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer