Sciweavers

1566 search results - page 147 / 314
» Contification Using Dominators
Sort
View
SP
2008
IEEE
115views Security Privacy» more  SP 2008»
14 years 10 months ago
Complexity in scalable computing
f abstraction (hardware) to the highest (people). This issue's theme encompasses this entire spectrum. The lead author of each article resides in the Scalable Computing Resear...
Damian W. I. Rouson
IJON
2007
81views more  IJON 2007»
14 years 10 months ago
Statistical analysis of spatially embedded networks: From grid to random node positions
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
Nicole Voges, Ad Aertsen, Stefan Rotter
TCAD
2008
88views more  TCAD 2008»
14 years 10 months ago
Self-Adaptive Data Caches for Soft-Error Reliability
Soft-error induced reliability problems have become a major challenge in designing new generation microprocessors. Due to the on-chip caches' dominant share in die area and tr...
Shuai Wang, Jie S. Hu, Sotirios G. Ziavras
TCS
2008
14 years 10 months ago
Approximation algorithms for partially covering with edges
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
Ojas Parekh
CCR
2005
101views more  CCR 2005»
14 years 10 months ago
Design choices for content distribution in P2P networks
Content distribution using the P2P paradigm has become one of the most dominant services in the Internet today. Most of the research effort in this area focuses on developing new ...
Anwar Al Hamra, Pascal Felber