5005 search results - page 859 / 1001 » The Design and Analysis of Parallel Algorithms |
204
Voted
BMCBI
2011
14 years 8 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...
147
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
224
click to vote
POPL
2007
ACM
16 years 4 months ago
2007
ACM
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
152
Voted
CLUSTER
2008
IEEE
15 years 11 months ago
2008
IEEE
—A key benefit of utility data centers and cloud computing infrastructures is the level of consolidation they can offer to arbitrary guest applications, and the substantial savi...
151
click to vote
CC
2006
Springer
15 years 8 months ago
2006
Springer
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...