Sciweavers

978 search results - page 71 / 196
» Knowledge, Probability, and Adversaries
Sort
View
FLAIRS
2009
14 years 7 months ago
Mining Default Rules from Statistical Data
In this paper, we are interested in the qualitative knowledge that underlies some given probabilistic information. To represent such qualitative structures, we use ordinal conditi...
Gabriele Kern-Isberner, Matthias Thimm, Marc Finth...
WWW
2005
ACM
15 years 10 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
FSE
2009
Springer
125views Cryptology» more  FSE 2009»
15 years 10 months ago
On the Security of Tandem-DM
Abstract. We provide the first proof of security for Tandem-DM, one of the oldest and most wellknown constructions for turning a blockcipher with n-bit blocklength and 2n-bit keyle...
Ewan Fleischmann, Michael Gorski, Stefan Lucks
SOSP
2003
ACM
15 years 6 months ago
Preserving peer replicas by rate-limited sampled voting
The LOCKSS project has developed and deployed in a worldwide test a peer-to-peer system for preserving access to journals and other archival information published on the Web. It c...
Petros Maniatis, David S. H. Rosenthal, Mema Rouss...
INFOCOM
2009
IEEE
15 years 4 months ago
Secure Range Queries in Tiered Sensor Networks
—We envision a two-tier sensor network which consists of resource-rich master nodes at the upper tier and resourcepoor sensor nodes at the lower tier. Master nodes collect data f...
Jing Shi, Rui Zhang, Yanchao Zhang