588 search results - page 62 / 118 » Reducibility and Completeness in Private Computations |
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
In order to reduce the overhead of synchronizing operations of shared memory multiprocessors, this paper proposes a mechanism, named specMEM, to execute memory accesses following ...
NDSS
1998
IEEE
14 years 2 months ago
1998
IEEE
In this work, we aim to reduce the computational costs of using public-key digital signatures in securing routing protocols. Two protocols (COSP and IOSP) using one-time digitalsi...
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
MOBIHOC
2012
ACM
12 years 12 days ago
2012
ACM
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
SAC
2009
ACM
14 years 4 months ago
2009
ACM
Ubiquitous computing and service-oriented computing enable the development of a new trend of applications that can opportunely interact with services discovered in the surrounding...