Separation Constraint Partitioning - A New Algorithm for Partitioning Non-strict Programs into Sequential Threads.
Klaus E. SchauserDavid E. CullerSeth Copen GoldsteinPublished in: POPL (1995)
Keyphrases
- learning algorithm
- cost function
- convergence rate
- high accuracy
- significant improvement
- improved algorithm
- detection algorithm
- worst case
- experimental evaluation
- dynamic programming
- k means
- objective function
- similarity measure
- np hard
- space partitioning
- computational complexity
- computational cost
- computationally efficient
- times faster
- disjoint subsets
- partitioning algorithm
- principal direction
- space complexity
- partitioning schemes
- recognition algorithm
- matching algorithm
- input data
- preprocessing
- optimal solution
- bayesian networks
- feature selection