A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem.
Olof DambergSverre StorøyTor SørevikPublished in: Comput. Optim. Appl. (1996)
Keyphrases
- input data
- data sets
- noisy data
- data reduction
- learning algorithm
- parallel implementation
- cost function
- preprocessing
- closed form
- matching algorithm
- objective function
- prior information
- data distribution
- synthetic datasets
- parallel version
- hardware implementation
- path planning
- synthetic data
- clustering method
- detection algorithm
- expectation maximization
- particle swarm optimization
- similarity measure
- data points
- probabilistic model
- dynamic programming
- np hard
- k means
- data analysis
- computational complexity
- information loss
- dense regions
- spectral clustering
- missing data
- high dimensional data
- data sources
- moving objects
- optimal solution
- genetic algorithm