Sciweavers

6365 search results - page 333 / 1273
» Fast Local Computation Algorithms
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
Network Performance Anomaly Detection and Localization
Abstract—Detecting the occurrence and location of performance anomalies (e.g., high jitter or loss events) is critical to ensuring the effective operation of network infrastructu...
Paul Barford, Nick G. Duffield, Amos Ron, Joel Som...
SOSP
2009
ACM
16 years 3 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
DAC
1999
ACM
16 years 7 months ago
A Multiscale Method for Fast Capacitance Extraction
The many levels of metal used in aggressive deep submicron process technologies has made fast and accurate capacitance extraction of complicated 3-D geometries of conductors essen...
Johannes Tausch, Jacob K. White
161
Voted
VISSYM
2007
15 years 9 months ago
Flexible And Topologically Localized Segmentation
One of the most common visualization tasks is the extraction of significant boundaries, often performed with isosurfaces or level set segmentation. Isosurface extraction is simple...
Gunnar Johansson, Ken Museth, Hamish Carr
ICCAD
2007
IEEE
161views Hardware» more  ICCAD 2007»
16 years 3 months ago
Clustering based pruning for statistical criticality computation under process variations
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
Hushrav Mogal, Haifeng Qian, Sachin S. Sapatnekar,...