Sciweavers

15033 search results - page 2959 / 3007
» Complexity Theory and Algorithms
Sort
View
ASPLOS
2008
ACM
14 years 11 months ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...
ATAL
2008
Springer
14 years 11 months ago
Resource limitations, transmission costs and critical thresholds in scale-free networks
Whether or not a critical threshold exists when epidemic diseases are spread in complex networks is a problem attracting attention from researchers in several disciplines. In 2001...
Chung-Yuan Huang, Chuen-Tsai Sun, Chia-Ying Cheng,...
CC
2008
Springer
193views System Software» more  CC 2008»
14 years 11 months ago
Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model
The polyhedral model provides powerful abstractions to optimize loop nests with regular accesses. Affine transformations in this model capture a complex sequence of execution-reord...
Uday Bondhugula, Muthu Manikandan Baskaran, Sriram...
CCS
2008
ACM
14 years 11 months ago
Efficient attributes for anonymous credentials
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
Jan Camenisch, Thomas Groß
CGO
2008
IEEE
14 years 11 months ago
Comprehensive path-sensitive data-flow analysis
Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex c...
Aditya V. Thakur, R. Govindarajan
« Prev « First page 2959 / 3007 Last » Next »