Sciweavers

283 search results - page 13 / 57
» On the Accuracy and Running Time of GSAT
Sort
View
BMCBI
2006
92views more  BMCBI 2006»
15 years 1 months ago
Recrafting the neighbor-joining method
Background: The neighbor-joining method by Saitou and Nei is a widely used method for constructing phylogenetic trees. The formulation of the method gives rise to a canonical (n3)...
Thomas Mailund, Gerth Stølting Brodal, Rolf...
IPPS
2000
IEEE
15 years 6 months ago
Predicting Performance on SMPs. A Case Study: The SGI Power Challenge
We study the issue of performance prediction on the SGIPower Challenge, a typical SMP. On such a platform, the cost of memory accesses depends on their locality and on contention ...
Nancy M. Amato, Jack Perdue, Mark M. Mathis, Andre...
IPPS
2005
IEEE
15 years 7 months ago
Automatic Construction and Evaluation of Performance Skeletons
The performance skeleton of an application is a short running program whose execution time in any scenario reflects the estimated execution time of the application it represents....
Sukhdeep Sodhi, Jaspal Subhlok
CLUSTER
2008
IEEE
15 years 1 months ago
Performance prediction with skeletons
The performance skeleton of an application is a short running program whose performance in any scenario reflects the performance of the application it represents. Specifically, th...
Sukhdeep Sodhi, Jaspal Subhlok, Qiang Xu
ACCV
2010
Springer
14 years 8 months ago
A Direct Method for Estimating Planar Projective Transform
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
Yu-Tseh Chi, Jeffrey Ho, Ming-Hsuan Yang