A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers.
Carlos E. R. AlvesEdson Norberto CáceresSiang Wun SongPublished in: Euro-Par (2006)
Keyphrases
- learning algorithm
- detection algorithm
- high accuracy
- computational cost
- objective function
- k means
- experimental evaluation
- recognition algorithm
- times faster
- computational complexity
- input data
- segmentation algorithm
- optimization algorithm
- optimal solution
- clustering method
- forward backward
- search space
- space partitioning
- minimum distance
- tree structure
- theoretical analysis
- probabilistic model
- high dimensional
- np hard
- cost function
- multi objective