145 search results - page 29 / 29 » Parallel Global Routing Algorithms for Standard Cells |
BMCBI
2011
12 years 9 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
NIPS
2004
13 years 7 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
CPHYSICS
2006
13 years 5 months ago
2006
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
APGV
2004
ACM
13 years 11 months ago
2004
ACM
The transition from traditional 24-bit RGB to high dynamic range (HDR) images is hindered by excessively large file formats with no backwards compatibility. In this paper, we prop...
PAMI
2010
13 years 4 months ago
2010
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...