Is Your Permutation Algorithm Unbiased for n ≠ 2 m ?
Michael WaechterKay HamacherFranziska HoffgaardSven WidmerMichael GoeselePublished in: PPAM (1) (2011)
Keyphrases
- times faster
- learning algorithm
- objective function
- significant improvement
- image segmentation
- improved algorithm
- cost function
- recognition algorithm
- detection algorithm
- experimental study
- experimental evaluation
- dynamic programming
- k means
- computational cost
- convergence rate
- preprocessing
- worst case
- memory requirements
- single pass
- estimation algorithm
- least squares
- segmentation algorithm
- itemsets
- expectation maximization
- maximum likelihood
- probabilistic model
- np hard
- search space
- optimal solution
- decision trees