5005 search results - page 93 / 1001 » The Design and Analysis of Parallel Algorithms |
103
Voted
CSB
2004
IEEE
15 years 4 months ago
2004
IEEE
There is considerable interest in computational methods to assist in the use of genetic polymorphism data for locating disease-related genes. Haplotypes, contiguous sets of correl...
JPDC
2006
15 years 17 days ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
CLEIEJ
2002
15 years 13 days ago
2002
Advances in parallel computation are of central importance to Artificial Intelligence due to the significant amount of time and space their programs require. Functional languages ...
106
click to vote
BMCBI
2008
15 years 22 days ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
ISCAS
2003
IEEE
15 years 5 months ago
2003
IEEE
—This paper presents high-speed parallel Reed–Solomon (RS) (255,239) decoder architecture using modified Euclidean algorithm for the high-speed multigigabit-per-second fiber op...