948 search results - page 50 / 190 » What can we achieve by arbitrary announcements |
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
FOCS
2003
IEEE
14 years 28 days ago
2003
IEEE
We show how a polynomial-time prover can commit to an arbitrary finite set Ë of strings so that, later on, he can, for any string Ü, reveal with a proof whether Ü ¾ Ë or Ü ...
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
—Wireless ad hoc networks are connected to the fixed Internet by means of Internet gateways. Whenever a node within the ad hoc network wishes to communicate with a host in the I...
PG
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we present a technique for image deformation in which the user is given flexible control over what kind of deformation to perform. Freeform image extends available ...