Sciweavers

2057 search results - page 139 / 412
» Quadratic placement using an improved timing model
Sort
View
SPAA
2005
ACM
16 years 9 hour ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams
BMCBI
2007
109views more  BMCBI 2007»
15 years 6 months ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....
JGAA
2006
100views more  JGAA 2006»
15 years 6 months ago
Orthogonal Hypergraph Drawing for Improved Visibility
Visualization of circuits is an important research area in electronic design automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses or...
Thomas Eschbach, Wolfgang Günther, Bernd Beck...
JIDM
2010
145views more  JIDM 2010»
15 years 4 months ago
Mining Relevant and Extreme Patterns on Climate Time Series with CLIPSMiner
One of the most important challenges for the researchers in the 21st Century is related to global heating and climate change that can have as consequence the intensification of na...
Luciana A. S. Romani, Ana Maria Heuminski de &Aacu...
PADS
2004
ACM
15 years 12 months ago
Event Reconstruction in Time Warp
In optimistic simulations, checkpointing techniques are often used to reduce the overhead caused by state saving. In this paper, we propose event reconstruction as a technique wit...
Lijun Li, Carl Tropper