38 search results - page 8 / 8 » Complexity of Intensive Communications on Balanced Generaliz... |
DAC
2008
ACM
16 years 17 days ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
IPSN
2009
Springer
15 years 6 months ago
2009
Springer
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
106
click to vote
CCS
2011
ACM
13 years 11 months ago
2011
ACM
We extend Goldberg’s multi-server information-theoretic private information retrieval (PIR) with a suite of protocols for privacypreserving e-commerce. Our first protocol adds ...