674 search results - page 58 / 135 » The computational complexity of the parallel knock-out probl... |
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
The overset grid methodology has significantly reduced time-to-solution of high-fidelity computational fluid dynamics (CFD) simulations about complex aerospace configurations....
130
click to vote
PODC
2010
ACM
15 years 3 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
85
Voted
VMV
2008
15 years 2 months ago
2008
Recently it was observed, that a combined formulation of tracking and reconstruction increases the robustness and accuracy of both these steps in structure-from-motion problems [9...
IPPS
2002
IEEE
15 years 6 months ago
2002
IEEE
Upon completion of the human and mouse genome sequences, world-wide sequencing capacity will turn to other complex organisms. Current strategies call for many of these genomes to ...
IPPS
1994
IEEE
15 years 5 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...