Sciweavers

5115 search results - page 678 / 1023
» On Randomized Lanczos Algorithms
Sort
View
ICICS
2005
Springer
16 years 3 days ago
Private Itemset Support Counting
Private itemset support counting (PISC) is a basic building block of various privacy-preserving data mining algorithms. Briefly, in PISC, Client wants to know the support of her i...
Sven Laur, Helger Lipmaa, Taneli Mielikäinen
PCI
2005
Springer
16 years 2 days ago
Storing and Locating Mutable Data in Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer overlay networks or Distributed Hash Tables (DHTs) are distributed systems optimized for storage and retrieval of read-only data. In this paper we elaborate...
Antony Chazapis, Nectarios Koziris
PKC
2005
Springer
114views Cryptology» more  PKC 2005»
16 years 2 days ago
Cryptanalysis of the Tractable Rational Map Cryptosystem
In this paper, we present the cryptanalysis of a public key scheme based on a system of multivariate polynomial equations, the ”tractable rational map” cryptosystem. We show co...
Antoine Joux, Sébastien Kunz-Jacques, Fr&ea...
STACS
2005
Springer
16 years 2 days ago
Centrality Measures Based on Current Flow
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
Ulrik Brandes, Daniel Fleischer
ADHOCNOW
2004
Springer
16 years 5 hour ago
Connectivity of Wireless Sensor Networks with Constant Density
We consider a wireless sensor network in which each sensor is able to transmit within a disk of radius one. We show with elementary techniques that there exists a constant c such t...
Sarah Carruthers, Valerie King