Sciweavers

165 search results - page 8 / 33
» Parallel Algorithm for Computing Reversal Distance
Sort
View
BMCBI
2010
135views more  BMCBI 2010»
15 years 2 months ago
MrsRF: an efficient MapReduce algorithm for analyzing large collections of evolutionary trees
Background: MapReduce is a parallel framework that has been used effectively to design largescale parallel applications for large computing clusters. In this paper, we evaluate th...
Suzanne Matthews, Tiffani L. Williams
CAD
2006
Springer
15 years 2 months ago
Constrained 3D shape reconstruction using a combination of surface fitting and registration
We investigate 3D shape reconstruction from measurement data in the presence of constraints. The constraints may fix the surface type or set geometric relations between parts of a...
Yang Liu, Helmut Pottmann, Wenping Wang
ISPAN
1997
IEEE
15 years 6 months ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal
CGO
2009
IEEE
15 years 6 months ago
Alchemist: A Transparent Dependence Distance Profiling Infrastructure
Effectively migrating sequential applications to take advantage of parallelism available on multicore platforms is a well-recognized challenge. This paper addresses important aspec...
Xiangyu Zhang, Armand Navabi, Suresh Jagannathan
HPCC
2007
Springer
15 years 8 months ago
Parallel Database Sort and Join Operations Revisited on Grids
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...
Werner Mach, Erich Schikuta