Sciweavers

1632 search results - page 281 / 327
» On special numberings of hypergraphs
Sort
View
SECON
2008
IEEE
16 years 21 days ago
SYNAPSE: A Network Reprogramming Protocol for Wireless Sensor Networks Using Fountain Codes
—Wireless reprogramming is a key functionality in Wireless Sensor Networks (WSNs). In fact, the requirements for the network may change in time, or new parameters might have to b...
Michele Rossi, Giovanni Zanca, Luca Stabellini, Ri...
NCA
2007
IEEE
16 years 17 days ago
Scheduling Bulk File Transfers with Start and End Times
The advancement of optical networking technologies has enabled e-science applications that often require transport of large volumes of scientific data. In support of such data-in...
Kannan Rajah, Sanjay Ranka, Ye Xia
CCS
2007
ACM
16 years 14 days ago
Pors: proofs of retrievability for large files
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
Ari Juels, Burton S. Kaliski Jr.
CIE
2007
Springer
16 years 14 days ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
16 years 14 days ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}...
Ueli M. Maurer, Stefano Tessaro