2474 search results - page 29 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
111
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
Loop distribution is one of the most useful techniques to reduce the execution time of parallel applications. Traditionally, loop scheduling algorithms are implemented based on pa...
132
click to vote
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
130
click to vote
CCGRID
2006
IEEE
15 years 3 months ago
2006
IEEE
In the Biodiversity World (BDW) project we have created a flexible and extensible Web Services-based Grid environment for biodiversity researchers to solve problems in biodiversity...
124
click to vote
IPPS
2006
IEEE
15 years 8 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...
124
click to vote
EUROSYS
2006
ACM
15 years 11 months ago
2006
ACM
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...