978 search results - page 65 / 196 » Knowledge, Probability, and Adversaries |
SIGMETRICS
2002
ACM
14 years 9 months ago
2002
ACM
On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line...
SEMWEB
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We propose semantic distance measures based on the criterion of approximate discernibility and on evidence combination. In the presence of incomplete knowledge, the dista...
TCC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we consider commitment schemes that are secure against concurrent man-in-the-middle (cMiM) attacks. Under such attacks, two possible notions of security for...
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—We develop a practical and comprehensive hybrid rogue access point (AP) detection framework for commodity WiFi networks. It is the first scheme that combines the distributed wi...