6105 search results - page 395 / 1221 » A Parallel Algorithm for Bound-Smoothing |
174
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents a new approach for the execution of coarse-grain (tiled) parallel SPMD code for applications derived from the explicit discretization of 2-dimensional PDE prob...
157
click to vote
CIKM
2007
Springer
16 years 1 months ago
2007
Springer
We study the parallelization of the (record) linkage problem – i.e., to identify matching records between two collections of records, A and B. One of main idiosyncrasies of the ...
184
click to vote
ICPPW
2006
IEEE
16 years 26 days ago
2006
IEEE
Many recent research efforts have been devoted to the use of commodity hardware for solving computationallyintensive scientific problems. Among such problems, hyperspectral imagi...
185
click to vote
IPPS
2006
IEEE
16 years 25 days ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
167
click to vote
IPPS
2006
IEEE
16 years 25 days ago
2006
IEEE
Multiple sequence alignment is a fundamental and very computationally intensive task in molecular biology. MUSCLE, a new algorithm for creating multiple alignments of protein sequ...