Sciweavers

6434 search results - page 1229 / 1287
» The Dynamic Data Cube
Sort
View
IPPS
2006
IEEE
15 years 4 months ago
Trust overlay networks for global reputation aggregation in P2P grid computing
1 This paper presents a new approach to trusted Grid computing in a Peer-to-Peer (P2P) setting. Trust and security are essential to establish lasting working relationships among th...
Runfang Zhou, Kai Hwang
ISCA
2006
IEEE
169views Hardware» more  ISCA 2006»
15 years 4 months ago
Balanced Cache: Reducing Conflict Misses of Direct-Mapped Caches
Level one cache normally resides on a processor’s critical path, which determines the clock frequency. Directmapped caches exhibit fast access time but poor hit rates compared w...
Chuanjun Zhang
MICRO
2006
IEEE
145views Hardware» more  MICRO 2006»
15 years 4 months ago
ASR: Adaptive Selective Replication for CMP Caches
The large working sets of commercial and scientific workloads stress the L2 caches of Chip Multiprocessors (CMPs). Some CMPs use a shared L2 cache to maximize the on-chip cache c...
Bradford M. Beckmann, Michael R. Marty, David A. W...
SECPERU
2006
IEEE
15 years 4 months ago
Detecting Critical Nodes for MANET Intrusion Detection Systems
Ad hoc routing protocols have been designed to efficiently reroute traffic when confronted with network congestion, faulty nodes, and dynamically changing topologies. The common d...
A. Karygiannis, E. Antonakakis, A. Apostolopoulos
COMPGEOM
2006
ACM
15 years 4 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir
« Prev « First page 1229 / 1287 Last » Next »