Sciweavers

583 search results - page 44 / 117
» New algorithms for efficient parallel string comparison
Sort
View
ICPP
2005
IEEE
15 years 8 months ago
Incremental Parallelization Using Navigational Programming: A Case Study
We show how a series of transformations can be applied to a sequential program to obtain programs that represent successive steps in exploiting parallelism in the original algorit...
Lei Pan, Wenhui Zhang, Arthur Asuncion, Ming Kin L...
IPPS
1994
IEEE
15 years 6 months ago
Efficient Matrix Chain Ordering in Polylog Time
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 ...
Phillip G. Bradford, Gregory J. E. Rawlins, Gregor...
IJDMB
2007
114views more  IJDMB 2007»
15 years 2 months ago
A parallel edge-betweenness clustering tool for Protein-Protein Interaction networks
: The increasing availability of protein-protein interaction graphs (PPI) requires new efficient tools capable of extracting valuable biological knowledge from these networks. Amon...
Qiaofeng Yang, Stefano Lonardi
103
Voted
ICPPW
2005
IEEE
15 years 8 months ago
A Practical Approach to the Rating of Barrier Algorithms Using the LogP Model and Open MPI
Large–scale parallel applications performing global synchronization may spend a significant amount of execution time waiting for the completion of a barrier operation. Conseque...
Torsten Hoefler, Lavinio Cerquetti, Torsten Mehlan...
104
Voted
ICIP
2008
IEEE
15 years 9 months ago
Localized and computationally efficient approach to shift-variant image deblurring
A new localized and computationally efficient approach is presented for shift/space-variant image restoration. Unlike conventional approaches, it models shift-variant blurring in...
Murali Subbarao, Youn-sik Kang, Satyaki Dutta, Xue...