Sciweavers

2996 search results - page 466 / 600
» Numberings and Randomness
Sort
View
ASIACRYPT
2009
Springer
15 years 10 months ago
Proofs of Storage from Homomorphic Identification Protocols
Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous work has shown that proofs of storage can be constru...
Giuseppe Ateniese, Seny Kamara, Jonathan Katz
CONEXT
2007
ACM
15 years 10 months ago
The diameter of opportunistic mobile networks
Portable devices have more data storage and increasing communication capabilities everyday. In addition to classic infrastructure based communication, these devices can exploit hu...
Augustin Chaintreau, Abderrahmen Mtibaa, Laurent M...
ASMTA
2009
Springer
92views Mathematics» more  ASMTA 2009»
15 years 10 months ago
Comparison of Multi-service Routing Strategies for IP Core Networks
Abstract. Service differentiation in IP core networks may be supported by dedicated path selection rules. This paper investigates the degree of service distinction achievable when ...
Ulf Jensen, Armin Heindl
KDD
2010
ACM
195views Data Mining» more  KDD 2010»
15 years 10 months ago
Universal multi-dimensional scaling
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
Arvind Agarwal, Jeff M. Phillips, Suresh Venkatasu...
HIPC
2007
Springer
15 years 10 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri