Sciweavers

164 search results - page 23 / 33
» Maximally joining probabilistic data
Sort
View
KDD
2002
ACM
110views Data Mining» more  KDD 2002»
15 years 10 months ago
A model for discovering customer value for E-content
There exists a huge demand for multimedia goods and services in the Internet. Currently available bandwidth speeds can support sale of downloadable content like CDs, e-books, etc....
Srinivasan Jagannathan, Jayanth Nayak, Kevin C. Al...
UIST
2010
ACM
14 years 7 months ago
Designing adaptive feedback for improving data entry accuracy
Data quality is critical for many information-intensive applications. One of the best opportunities to improve data quality is during entry. USHER provides a theoretical, data-dri...
Kuang Chen, Joseph M. Hellerstein, Tapan S. Parikh
105
Voted
UAI
1998
14 years 11 months ago
The Bayesian Structural EM Algorithm
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...
Nir Friedman
61
Voted
CAS
2007
87views more  CAS 2007»
14 years 9 months ago
An Accelerated Algorithm for Density Estimation in Large Databases Using Gaussian Mixtures
Today, with the advances of computer storage and technology, there are huge datasets available, offering an opportunity to extract valuable information. Probabilistic approaches ...
Alvaro Soto, Felipe Zavala, Anita Araneda
80
Voted
P2P
2010
IEEE
167views Communications» more  P2P 2010»
14 years 7 months ago
Boosting Gossip for Live Streaming
Gossip protocols are considered very effective to disseminate information in a large scale dynamic distributed system. Their inherent simplicity makes them easy to implement and de...
Davide Frey, Rachid Guerraoui, Anne-Marie Kermarre...