Sciweavers

5005 search results - page 355 / 1001
» The Design and Analysis of Parallel Algorithms
Sort
View
ICPPW
2009
IEEE
15 years 11 months ago
Evaluation of Existing Schedulability Tests for Global EDF
—The increasing attention on global scheduling algorithms for identical multiprocessor platforms produced different, independently developed, schedulability tests. However, the e...
Marko Bertogna
SPAA
2003
ACM
15 years 10 months ago
The complexity of verifying memory coherence
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
Jason F. Cantin, Mikko H. Lipasti, James E. Smith
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
15 years 9 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
TSP
2008
166views more  TSP 2008»
15 years 4 months ago
Blind Identification of Underdetermined Mixtures by Simultaneous Matrix Diagonalization
Abstract--In this paper, we study simultaneous matrix diagonalization-based techniques for the estimation of the mixing matrix in underdetermined independent component analysis (IC...
Lieven De Lathauwer, Joséphine Castaing
MICCAI
2002
Springer
16 years 6 months ago
Robust Registration of Multi-modal Images: Towards Real-Time Clinical Applications
Abstract. High performance computing has become a key step to introduce computer tools, like real-time registration, in the medical field. To achieve real-time processing, one usua...
Radu Stefanescu, Sébastien Ourselin, Xavier...