874 search results - page 79 / 175 » Practical Algorithms for Selection on Coarse-Grained Paralle... |
ANCS
2009
ACM
13 years 6 months ago
2009
ACM
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
Studies of the fault-tolerance of graphs have tended to largely concentrate on classical graph connectivity. This measure is very basic, and conveys very little information for des...
MST
2002
13 years 8 months ago
2002
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
FPL
2010
Springer
13 years 7 months ago
2010
Springer
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
In this work we propose a convex relaxation approach
for computing minimal partitions. Our approach is based
on rewriting the minimal partition problem (also known as
Potts mode...