349 search results - page 60 / 70 » High Performance Computing in Europe and USA: A Comparison |
135
click to vote
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
115
click to vote
PR
2011
14 years 6 months ago
2011
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
111
Voted
VTC
2008
IEEE
15 years 6 months ago
2008
IEEE
—When the maximum number of best candidates retained at each tree search level of the K-Best Sphere Detection (SD) is kept low for the sake of maintaining a low memory requiremen...
120
click to vote
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
103
click to vote
BMCBI
2004
14 years 11 months ago
2004
Background: Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a u...