978 search results - page 86 / 196 » Knowledge, Probability, and Adversaries |
110
click to vote
SSS
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. This paper evaluates the performance of two seminal rateless erasure codes, LT Codes and Online Codes. Their properties make them appropriate for coping with communicatio...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented ...
123
click to vote
INFOCOM
2012
IEEE
13 years 11 days ago
2012
IEEE
—Location sharing is a fundamental component of mobile online social networks (mOSNs), which also raises significant privacy concerns. The mOSNs collect a large amount of locati...
AMAI
2002
Springer
14 years 9 months ago
2002
Springer
: We concern ourselves with the situation Here we investigate an extension of the basic concept of in which we use the Dempster-Shafer belief structure to a compatibility relation ...
EKAW
2004
Springer
15 years 3 months ago
2004
Springer
For more than a decade, ontologies have been proposed as a means to enable sharing and reuse of knowledge. While originally relatively narrow information landscapes have been in mi...