6437 search results - page 417 / 1288 » Parallel Algorithms for Arrangements |
127
Voted
CIKM
2007
Springer
15 years 11 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 ...
154
Voted
ICPPW
2006
IEEE
15 years 10 months 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...
151
Voted
IPPS
2006
IEEE
15 years 10 months 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...
131
click to vote
IPPS
2006
IEEE
15 years 10 months 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...
144
click to vote
ICCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. A new approach for acquiring knowledge of parallel applications regarding resource usage and for searching similarity on workload traces is presented. The main goal is to...