Sciweavers

3257 search results - page 420 / 652
» Some Results on Effective Randomness
Sort
View
TMA
2010
Springer
166views Management» more  TMA 2010»
16 years 1 months ago
Understanding and Preparing for DNS Evolution
The Domain Name System (DNS) is a crucial component of today’s Internet. The top layer of the DNS hierarchy (the root nameservers) is facing dramatic changes: cryptographically s...
Sebastian Castro, Min Zhang, Wolfgang John, Duane ...
ASIACRYPT
2009
Springer
16 years 1 months ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...
COMPGEOM
2009
ACM
16 years 1 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
VTC
2008
IEEE
125views Communications» more  VTC 2008»
16 years 1 months ago
A General Formula for Log-MGF Computation: Application to the Approximation of Log-Normal Power Sum via Pearson Type IV Distribu
Abstract— In [1], we have recently proposed a general approach for approximating the power sum of Log–Normal Random Variables (RVs) by using the Pearson system of distributions...
Marco Di Renzo, Fabio Graziosi, Fortunato Santucci
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
16 years 3 days ago
Polynomial Deterministic Rendezvous in Arbitrary Graphs
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
Dariusz R. Kowalski, Andrzej Pelc