Sciweavers

1806 search results - page 181 / 362
» Randomness and halting probabilities
Sort
View
128
Voted
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
15 years 5 months ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...
136
Voted
SIGECOM
2008
ACM
138views ECommerce» more  SIGECOM 2008»
15 years 3 months ago
Generalized scoring rules and the frequency of coalitional manipulability
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
Lirong Xia, Vincent Conitzer
EUROPAR
2009
Springer
15 years 10 months ago
Adaptive Peer Sampling with Newscast
Abstract. The peer sampling service is a middleware service that provides random samples from a large decentralized network to support gossip-based applications such as multicast, ...
Norbert Tölgyesi, Márk Jelasity
130
Voted
PKDD
2007
Springer
120views Data Mining» more  PKDD 2007»
15 years 9 months ago
Privacy Preserving Market Basket Data Analysis
Randomized Response techniques have been empirically investigated in privacy preserving association rule mining. However, previous research on privacy preserving market basket data...
Ling Guo, Songtao Guo, Xintao Wu
114
Voted
ICDT
2005
ACM
124views Database» more  ICDT 2005»
15 years 9 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken