Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

107

EUROPAR
2006
Springer

121views Distributed And Parallel Com...» more EUROPAR 2006»

A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers

15 years 6 months ago

A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers

Download www.ime.usp.br

Carlos E. R. Alves, Edson Norberto Cáceres,

Real-time Traffic

Distributed And Parallel Computing | EUROPAR 2006 |

claim paper

Related Content

» All Common Subsequences

» Computing Maximum Subsequence in Parallel

» On the maximal cliques in cmaxtolerance graphs and their application in clustering molecul...

» Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery

» Finding Sequential Patterns from Large Sequence Data

» Finding regulatory elements and regulatory motifs a general probabilistic framework

» Efficient Processing of Warping Time Series Join of Motion Capture Data

» Theoretical Framework for Eliminating Redundancy in Workflows

» Combinatorial Problems on Strings with Applications to Protein Folding

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	EUROPAR
Authors	Carlos E. R. Alves, Edson Norberto Cáceres, Siang Wun Song

Comments (0)