Sciweavers

208 search results - page 32 / 42
» Computing Anonymously with Arbitrary Knowledge
Sort
View
IACR
2011
105views more  IACR 2011»
12 years 9 months ago
Leakage Tolerant Interactive Protocols
We put forth a framework for expressing security requirements from interactive protocols in the presence of arbitrary leakage. This allows capturing different levels of leakage to...
Nir Bitansky, Ran Canetti, Shai Halevi
CCR
2006
118views more  CCR 2006»
13 years 10 months ago
Tmix: a tool for generating realistic TCP application workloads in ns-2
In order to perform realistic network simulations, one needs a traffic generator that is capable of generating realistic synthetic traffic in a closed-loop fashion that "look...
Michele C. Weigle, Prashanth Adurthi, Félix...
DEBS
2008
ACM
13 years 12 months ago
Extending Siena to support more expressive and flexible subscriptions
This paper defines and discusses the implementation of two novel extensions to the Siena Content-based Network (CBN) to extend it to become a Knowledge-based Network (KBN) thereby...
John Keeney, Dominik Roblek, Dominic Jones, David ...
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
13 years 11 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
WWW
2007
ACM
14 years 10 months ago
Using Google distance to weight approximate ontology matches
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
Risto Gligorov, Warner ten Kate, Zharko Aleksovski...