Sciweavers

612 search results - page 117 / 123
» Division for Foundation of Software
Sort
View
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 3 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
HPCA
1996
IEEE
15 years 3 months ago
A Comparison of Entry Consistency and Lazy Release Consistency Implementations
This paper compares several implementations of entry consistency (EC) and lazy release consistency (LRC), two relaxed memory models in use with software distributed shared memory ...
Sarita V. Adve, Alan L. Cox, Sandhya Dwarkadas, Ra...
CCS
2007
ACM
15 years 3 months ago
Analyzing network traffic to detect self-decrypting exploit code
Remotely-launched software exploits are a common way for attackers to intrude into vulnerable computer systems. As detection techniques improve, remote exploitation techniques are...
Qinghua Zhang, Douglas S. Reeves, Peng Ning, S. Pu...
CCS
2006
ACM
15 years 3 months ago
Design space and analysis of worm defense strategies
We give the first systematic investigation of the design space of worm defense system strategies. We accomplish this by g a taxonomy of defense strategies by abstracting away impl...
David Brumley, Li-Hao Liu, Pongsin Poosankam, Dawn...
CF
2006
ACM
15 years 3 months ago
Performance characteristics of an adaptive mesh refinement calculation on scalar and vector platforms
Adaptive mesh refinement (AMR) is a powerful technique that reduces the resources necessary to solve otherwise intractable problems in computational science. The AMR strategy solv...
Michael L. Welcome, Charles A. Rendleman, Leonid O...