3630 search results - page 154 / 726 » Fast Marching Methods |
156
click to vote
RSCTC
2010
Springer
15 years 4 months ago
2010
Springer
Randomisation is a method to test the statistical significance of a symbolic rule; it is, however, very expensive. In this paper we present a sequential randomisation test which d...
151
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: As an alternative to the frequently used "reference design" for two-channel microarrays, other designs have been proposed. These designs have been shown to b...
171
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
In order to optimize interconnect to avoid signal integrity problems, very fast and accurate 3-D capacitance extraction is essential. Fast algorithms, such as the multipole or prec...
173
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
205
click to vote
DAC
2012
ACM
13 years 8 months ago
2012
ACM
Improving detailed routing routability is an important objective of a global router. In this paper, we propose GDRouter, an interleaved global routing and detailed routing algorit...