Sciweavers

9231 search results - page 1820 / 1847
» informs 2008
Sort
View
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 12 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
ASPDAC
2008
ACM
104views Hardware» more  ASPDAC 2008»
13 years 12 months ago
Variability-driven module selection with joint design time optimization and post-silicon tuning
Abstract-- Increasing delay and power variation are significant challenges to the designers as technology scales to the deep sub-micron (DSM) regime. Traditional module selection t...
Feng Wang 0004, Xiaoxia Wu, Yuan Xie
ASPLOS
2008
ACM
13 years 12 months ago
Hardbound: architectural support for spatial safety of the C programming language
The C programming language is at least as well known for its absence of spatial memory safety guarantees (i.e., lack of bounds checking) as it is for its high performance. C'...
Joe Devietti, Colin Blundell, Milo M. K. Martin, S...
ASPLOS
2008
ACM
13 years 12 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...
ASPLOS
2008
ACM
13 years 12 months ago
Archipelago: trading address space for reliability and security
Memory errors are a notorious source of security vulnerabilities that can lead to service interruptions, information leakage and unauthorized access. Because such errors are also ...
Vitaliy B. Lvin, Gene Novark, Emery D. Berger, Ben...
« Prev « First page 1820 / 1847 Last » Next »