2168 search results - page 362 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
153
Voted
ICS
2004
Tsinghua U.
15 years 9 months ago
2004
Tsinghua U.
We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to e...
121
Voted
HPCA
2008
IEEE
16 years 4 months ago
2008
IEEE
A conceptually appealing approach to supporting a broad range of workloads is a system comprising many small cores that can be fused, on demand, into larger cores. We demonstrate ...
143
Voted
CCS
2007
ACM
15 years 9 months ago
2007
ACM
Traditional Public Key Infrastructures (PKI) have not lived up to their promise because there are too many ways to define PKIs, too many cryptographic primitives to build them wi...
134
Voted
SENSYS
2006
ACM
15 years 9 months ago
2006
ACM
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
148
Voted
MOBICOM
2005
ACM
15 years 9 months ago
2005
ACM
In old times, castles were surrounded by moats (deep trenches filled with water, and even alligators) to thwart or discourage intrusion attempts. One can now replace such barrier...