On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing.
Michele FlamminiMordechai ShalomShmuel ZaksPublished in: CAAN (2006)
Keyphrases
- preprocessing
- tight bounds
- computational complexity
- experimental evaluation
- objective function
- k means
- space complexity
- improved algorithm
- high accuracy
- computationally efficient
- upper bound
- cost function
- learning algorithm
- polynomial time complexity
- memory requirements
- convex hull
- times faster
- matching algorithm
- execution times
- input data
- linear programming
- probabilistic model
- computational cost
- np hard
- significant improvement
- worst case
- theoretical analysis
- detection algorithm
- clustering method
- small number
- support vector machine
- search algorithm
- preprocessing stage
- data structure
- optimal solution