6365 search results - page 307 / 1273 » Fast Local Computation Algorithms |
186
click to vote
ICFP
2005
ACM
16 years 7 days ago
2005
ACM
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
182
click to vote
DAC
2003
ACM
15 years 12 months ago
2003
ACM
In this paper we propose a partitioning-based placement algorithm for FPGAs. The method incorporates simple, but effective heuristics that target delay minimization. The placement...
176
click to vote
CGI
2000
IEEE
15 years 11 months ago
2000
IEEE
An ideal triangle mesh compression technology would simultaneously support the following three objectives: (1) progressive refinements of the received mesh during decompression, (...
158
click to vote
JCC
2010
15 years 5 months ago
2010
: Finding the rotational matrix that minimizes the sum of squared deviations between two vectors is an important problem in bioinformatics and crystallography. Traditional algorith...
169
click to vote
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...