Sciweavers

19700 search results - page 39 / 3940
» DNA-Based Computation Times
Sort
View
DAC
2006
ACM
14 years 11 months ago
Criticality computation in parameterized statistical timing
Chips manufactured in 90 nm technology have shown large parametric variations, and a worsening trend is predicted. These parametric variations make circuit optimization difficult ...
Jinjun Xiong, Vladimir Zolotov, Natesan Venkateswa...
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 10 months ago
Locally computable approximations for spectral clustering and absorption times of random walks
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos...
ICCAD
2004
IEEE
107views Hardware» more  ICCAD 2004»
14 years 6 months ago
Computation of signal threshold crossing times directly from higher order moments
—This paper introduces a simple method for calculating the times at which any signal crosses a prespecified threshold voltage (e.g., 10%, 20%, 50%, etc.) directly from the moment...
Yehea I. Ismail, Chirayu S. Amin
PVM
2007
Springer
14 years 4 months ago
Distributed Real-Time Computing with Harness
Abstract. Modern parallel and distributed computing solutions are often built onto a “middleware” software layer providing a higher and common level of service between computat...
Emanuele Di Saverio, Marco Cesati, Christian Di Bi...
FOCS
2008
IEEE
14 years 4 months ago
Computing the Tutte Polynomial in Vertex-Exponential Time
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
Andreas Björklund, Thore Husfeldt, Petteri Ka...