A Simple and Fast Linear-Time Algorithm for Proportional Apportionment.
Sebastian WildRaphael ReitzigPublished in: CoRR (2015)
Keyphrases
- experimental evaluation
- computational complexity
- detection algorithm
- worst case
- cost function
- optimization algorithm
- preprocessing
- objective function
- search space
- np hard
- computational cost
- probabilistic model
- experimental study
- learning algorithm
- memory requirements
- computationally efficient
- convergence rate
- improved algorithm
- dynamic programming
- significant improvement
- k means
- simulated annealing
- expectation maximization
- theoretical analysis
- artificial neural networks
- tree structure
- classification algorithm
- times faster
- data streams
- face recognition
- neural network
- linear space
- minimum length