10988 search results - page 139 / 2198 » Algorithmic Folding Complexity |
127
click to vote
ICS
2004
Tsinghua U.
15 years 8 months ago
2004
Tsinghua U.
Storage mapping optimization is a flexible approach to folding array dimensions in numerical codes. It is designed to reduce the memory footprint after a wide spectrum of loop tr...
113
click to vote
JCB
2007
15 years 2 months ago
2007
Analysis of biopolymer sequences and structures generally adopts one of two approaches: use of detailed biophysical theoretical models of the system with experimentally-determined...
135
Voted
TC
2010
15 years 1 months ago
2010
—The most pervasive compute operation carried out in almost all bioinformatics applications is pairwise sequence homology detection (or sequence alignment). Due to exponentially ...
114
Voted
SOFSEM
2009
Springer
15 years 11 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
137
Voted
STACS
2009
Springer
15 years 9 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...