Sciweavers

978 search results - page 54 / 196
» Knowledge, Probability, and Adversaries
Sort
View
WEBNET
2000
14 years 11 months ago
Conventions for Knowledge Representation via RDF
The Resource Description Framework [RDF] provides a basic model to describe relationships between objects. Ultimately, it is intended to permit the representation, combination and ...
Philippe Martin, Peter W. Eklund
WIOPT
2010
IEEE
14 years 8 months ago
Effect of limited topology knowledge on opportunistic forwarding in ad hoc wireless networks
—Opportunistic forwarding is a simple scheme for packet routing in ad hoc wireless networks such as duty cycling sensor networks in which reducing energy consumption is a princip...
Prithwish Basu, Saikat Guha
DCOSS
2008
Springer
14 years 11 months ago
An Information Theoretic Framework for Field Monitoring Using Autonomously Mobile Sensors
We consider a mobile sensor network monitoring a spatio-temporal field. Given limited caches at the sensor nodes, the goal is to develop a distributed cache management algorithm to...
Hany Morcos, George Atia, Azer Bestavros, Ibrahim ...
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
15 years 10 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
15 years 10 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking