Sciweavers

876 search results - page 104 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
SP
2008
IEEE
117views Security Privacy» more  SP 2008»
15 years 7 months ago
Anonymous Networking with Minimum Latency in Multihop Networks
The problem of security against timing based traffic analysis in multihop networks is considered in this work. In particular, the relationship between the level of anonymity prov...
Parvathinathan Venkitasubramaniam, Lang Tong
EMMCVPR
2005
Springer
15 years 6 months ago
Exploiting Inference for Approximate Parameter Learning in Discriminative Fields: An Empirical Study
Abstract. Estimation of parameters of random field models from labeled training data is crucial for their good performance in many image analysis applications. In this paper, we p...
Sanjiv Kumar, Jonas August, Martial Hebert
TON
2002
175views more  TON 2002»
15 years 19 days ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
RAID
2010
Springer
14 years 11 months ago
Anomaly Detection and Mitigation for Disaster Area Networks
Abstract. One of the most challenging applications of wireless networking are in disaster area networks where lack of infrastructure, limited energy resources, need for common oper...
Jordi Cucurull, Mikael Asplund, Simin Nadjm-Tehran...
ALGORITHMICA
2011
14 years 8 months ago
Knowledge State Algorithms
We introduce the concept of knowledge states; many well-known algorithms can be viewed as knowledge state algorithms. The knowledge state approach can be used to to construct comp...
Wolfgang W. Bein, Lawrence L. Larmore, John Noga, ...