Sciweavers

432 search results - page 37 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
IPPS
2005
IEEE
15 years 7 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
AINA
2006
IEEE
15 years 8 months ago
On Optimization and Parallelization of Fuzzy Connected Segmentation for Medical Imaging
Fuzzy Connectedness is an important image segmentation routine for image processing of medical images. It is often used in preparation for surgery and sometimes during surgery. It...
Christopher Gammage, Vipin Chaudhary
IPPS
2006
IEEE
15 years 8 months ago
Making lockless synchronization fast: performance implications of memory reclamation
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
Thomas E. Hart, Paul E. McKenney, Angela Demke Bro...
CVPR
2007
IEEE
16 years 3 months ago
A Fast 3D Correspondence Method for Statistical Shape Modeling
Accurately identifying corresponded landmarks from a population of shape instances is the major challenge in constructing statistical shape models. In this paper, we address this ...
Pahal Dalal, Brent C. Munsell, Song Wang, Jijun Ta...
IPPS
2007
IEEE
15 years 8 months ago
Performance Analysis of a Family of WHT Algorithms
This paper explores the correlation of instruction counts and cache misses to runtime performance for a large family of divide and conquer algorithms to compute the Walsh–Hadama...
Michael Andrews, Jeremy Johnson