Sciweavers

2609 search results - page 431 / 522
» Optimizing for parallelism and data locality
Sort
View
97
Voted
IPPS
2003
IEEE
15 years 5 months ago
Phylogenetic Tree Inference on PC Architectures with AxML/PAxML
Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the maximum likelihood method is computationally extremely expensive. In previous work,...
Alexandros Stamatakis, Thomas Ludwig 0002
CF
2008
ACM
15 years 2 months ago
Cell-SWat: modeling and scheduling wavefront computations on the cell broadband engine
This paper contributes and evaluates a model and a methodology for implementing parallel wavefront algorithms on the Cell Broadband Engine. Wavefront algorithms are vital in sever...
Ashwin M. Aji, Wu-chun Feng, Filip Blagojevic, Dim...
CVPR
2009
IEEE
16 years 4 months ago
Distributed Volumetric Scene Geometry Reconstruction With a Network of Distributed Smart Cameras
Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless c...
Shubao Liu, Kongbin Kang, Jean-Philippe Tarel and ...
94
Voted
CVPR
2007
IEEE
15 years 7 months ago
Dense mirroring surface recovery from 1D homographies and sparse correspondences
In this work we recover the 3D shape of mirroring objects such as mirrors, sunglasses, and stainless steel objects. A computer monitor displays several images of parallel stripes,...
Stas Rozenfeld, Ilan Shimshoni, Michael Lindenbaum
159
Voted
BMCBI
2011
14 years 4 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes