Sciweavers

4747 search results - page 426 / 950
» Shuffle Memory System
Sort
View
PODC
2010
ACM
15 years 8 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 6 months ago
JIT Spraying and Mitigations
With the discovery of new exploit techniques, novel protection mechanisms are needed as well. Mitigations like DEP (Data Execution Prevention) or ASLR (Address Space Layout Random...
Piotr Bania
IM
2007
15 years 6 months ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito
ENTCS
2002
72views more  ENTCS 2002»
15 years 6 months ago
A Symbolic Out-of-Core Solution Method for Markov Models
Despite considerable effort, the state-space explosion problem remains an issue in the analysis of Markov models. Given structure, symbolic representations can result in very comp...
Marta Z. Kwiatkowska, Rashid Mehmood, Gethin Norma...
TPDS
2002
94views more  TPDS 2002»
15 years 6 months ago
Recursive Array Layouts and Fast Matrix Multiplication
The performance of both serial and parallel implementations of matrix multiplication is highly sensitive to memory system behavior. False sharing and cache conflicts cause traditi...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....