Sciweavers

114 search results - page 1 / 23
» A new approach to parallelising tracing algorithms
Sort
View
IWMM
2009
Springer
152views Hardware» more  IWMM 2009»
13 years 10 months ago
A new approach to parallelising tracing algorithms
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt
BMCBI
2011
12 years 7 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
EUROPAR
2001
Springer
13 years 8 months ago
Experiments in Parallel Clustering with DBSCAN
We present a new result concerning the parallelisation of DBSCAN, a Data Mining algorithm for density-based spatial clustering. The overall structure of DBSCAN has been mapped to a...
Domenica Arlia, Massimo Coppola
CG
2008
Springer
13 years 3 months ago
Parallel techniques for physically based simulation on multi-core processor architectures
As multi-core processor systems become more and more widespread, the demand for efficient parallel algorithms also propagates into the field of computer graphics. This is especial...
Bernhard Thomaszewski, Simon Pabst, Wolfgang Bloch...
ICDAR
2011
IEEE
12 years 3 months ago
A New Text-Line Alignment Approach Based on Piece-Wise Painting Algorithm for Handwritten Documents
—Because of writing styles of different individuals, some of the text-lines may be curved in shape. For recognition of such text-lines, their proper alignment is necessary. In th...
Alireza Alaei, P. Nagabhushan, Umapada Pal