Sciweavers

1450 search results - page 75 / 290
» On the Complexity of Hardness Amplification
Sort
View
INFOCOM
2012
IEEE
11 years 11 months ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
TOG
2012
224views Communications» more  TOG 2012»
11 years 11 months ago
Lagrangian vortex sheets for animating fluids
Buoyant turbulent smoke plumes with a sharp smoke-air interface, such as volcanic plumes, are notoriously hard to simulate. The surface clearly shows small-scale turbulent structu...
Tobias Pfaff, Nils Thürey, Markus H. Gross
ICCAD
2004
IEEE
94views Hardware» more  ICCAD 2004»
14 years 6 months ago
Timing macro-modeling of IP blocks with crosstalk
With the increase of design complexities and the decrease of minimal feature sizes, IP reuse is becoming a common practice while crosstalk is becoming a critical issue that must b...
Ruiming Chen, Hai Zhou
DSN
2006
IEEE
14 years 3 months ago
Dependability Analysis of Virtual Memory Systems
Recent research has shown that even modern hard disks have complex failure modes that do not conform to “failstop” operation. Disks exhibit partial failures like block access ...
Lakshmi N. Bairavasundaram, Andrea C. Arpaci-Dusse...
EMSOFT
2003
Springer
14 years 2 months ago
Schedule-Carrying Code
We introduce the paradigm of schedule-carrying code (SCC). A hard real-time program can be executed on a given platform only if there exists a feasible schedule for the real-time t...
Thomas A. Henzinger, Christoph M. Kirsch, Slobodan...