4488 search results - page 249 / 898 » Properties of NP-Complete Sets |
217
click to vote
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
In CRYPTO 1997, Canetti et al.put forward the intruiging notion of deniable encryption, which (informally) allows a sender and/or receiver, having already performed some encrypted...
198
click to vote
ICC
2011
IEEE
14 years 6 months ago
2011
IEEE
—In this paper, we investigate the transmission completion time minimization problem in a two-user additive white Gaussian noise (AWGN) broadcast channel, where the transmitter i...
186
click to vote
BIRTHDAY
2012
Springer
14 years 2 months ago
2012
Springer
The 40 thieves realize that the fortune in their cave is vanishing. A rumor says that Ali Baba has been granted access (in the form of a certificate) to the cave but they need evi...
180
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
244
click to vote
PODS
2012
ACM
13 years 9 months ago
2012
ACM
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...