92 search results - page 5 / 19 » Scalable parallel graph coloring algorithms |
125
Voted
ICPP
2006
IEEE
15 years 8 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
105
Voted
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper presents a parallel framework of grid-based numerical algorithms where data dependencies between grid zones can be modeled by a directed acyclic graph (DAG). It consist...
139
Voted
BMCBI
2010
15 years 2 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
137
Voted
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
RDF is a data model for representing labeled directed graphs, and it is used as an important building block of semantic web. Due to its flexibility and applicability, RDF has bee...
149
Voted
PPOPP
2009
ACM
16 years 3 months ago
2009
ACM
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...