Sciweavers

1845 search results - page 284 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
UAI
1997
13 years 9 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
14 years 8 months ago
Collusion-resistant anonymous data collection method
The availability and the accuracy of the data dictate the success of a data mining application. Increasingly, there is a need to resort to on-line data collection to address the p...
Mafruz Zaman Ashrafi, See-Kiong Ng
INFOCOM
2008
IEEE
14 years 2 months ago
Probabilistic Approach to Provisioning Guaranteed QoS for Distributed Event Detection
—It has been of significant importance to provision network-wide guaranteed QoS for a wide range of event detection applications in wireless sensor networks (WSNs). This paper in...
Yanmin Zhu, Lionel M. Ni
WWW
2005
ACM
14 years 8 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
OPODIS
2010
13 years 6 months ago
Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
Achour Mostéfaoui, Michel Raynal