Sciweavers

3663 search results - page 468 / 733
» Problems in the ontology of computer programs
Sort
View
CVPR
2008
IEEE
16 years 8 months ago
A polynomial-time bound for matching and registration with outliers
We present a framework for computing optimal transformations, aligning one point set to another, in the presence of outliers. Example applications include shape matching and regis...
Carl Olsson, Olof Enqvist, Fredrik Kahl
IPPS
2009
IEEE
16 years 1 months ago
Minimizing startup costs for performance-critical threading
—Using the well-known ATLAS and LAPACK dense linear algebra libraries, we demonstrate that the parallel management overhead (PMO) can grow with problem size on even statically sc...
Anthony M. Castaldo, R. Clint Whaley
ESA
2009
Springer
143views Algorithms» more  ESA 2009»
16 years 1 months ago
On Optimally Partitioning a Text to Improve Its Compression
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
Paolo Ferragina, Igor Nitto, Rossano Venturini
GCB
2009
Springer
481views Biometrics» more  GCB 2009»
16 years 1 months ago
CUDA-based Multi-core Implementation of MDS-based Bioinformatics Algorithms
: Solving problems in bioinformatics often needs extensive computational power. Current trends in processor architecture, especially massive multi-core processors for graphic cards...
Thilo Fester, Falk Schreiber, Marc Strickert
PACT
2009
Springer
16 years 1 months ago
Parallel FFT with Eden Skeletons
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
Jost Berthold, Mischa Dieterle, Oleg Lobachev, Rit...