Sciweavers

2570 search results - page 212 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
SC
2000
ACM
15 years 7 months ago
A Unified Algorithm for Load-balancing Adaptive Scientific Simulations
Adaptive scientific simulations require that periodic repartitioning occur dynamically throughout the course of the computation. The repartitionings should be computed so as to mi...
Kirk Schloegel, George Karypis, Vipin Kumar
MIRAGE
2009
Springer
15 years 10 months ago
Interpreting Face Images by Fitting a Fast Illumination-Based 3D Active Appearance Model
Abstract. We present a fast and robust iterative method for interpreting face images under non-uniform lighting conditions by using a fitting algorithm which utilizes an illuminat...
Salvador E. Ayala-Raggi, Leopoldo Altamirano Roble...
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
15 years 8 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
ICPR
2004
IEEE
16 years 5 months ago
Reconstruction of Medical Images by Perspective Shape-from-Shading
Shape-from-Shading (SfS) is a fundamental problem in Computer Vision; it is based upon the image irradiance equation. Recently, the authors proposed to solve the image irradiance ...
Ariel Tankus, Nir A. Sochen, Yehezkel Yeshurun
BMCBI
2004
156views more  BMCBI 2004»
15 years 4 months ago
DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors
Background: Parallel computing is frequently used to speed up computationally expensive tasks in Bioinformatics. Results: Herein, a parallel version of the multi-alignment program...
Martin Schmollinger, Kay Nieselt, Michael Kaufmann...