Sciweavers

2996 search results - page 519 / 600
» Numberings and Randomness
Sort
View
ICALP
2005
Springer
15 years 5 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
MOBICOM
2004
ACM
15 years 5 months ago
Analyzing the spread of active worms over VANET
Interactive communications among nodes in Vehicular Ad Hoc Networks (VANET) and the safety-oriented nature of many VANET applications necessitate a robust security framework. An a...
Syed A. Khayam, Hayder Radha
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 5 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
15 years 5 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
DIAGRAMS
2004
Springer
15 years 5 months ago
Bayesian Boxes: A Colored Calculator for Picturing Posteriors
The need for Bayesian inference arises in military intelligence, medical diagnosis and many other practical applications. The problem is that human inferences are generally conserv...
Kevin Burns