A bounded space algorithm for online circle packing.
Pedro Henrique Del Bianco HokamaFlávio Keidi MiyazawaRafael Crivellari Saliba SchoueryPublished in: Inf. Process. Lett. (2016)
Keyphrases
- higher dimensional
- learning algorithm
- detection algorithm
- computationally efficient
- passive aggressive
- theoretical analysis
- worst case
- np hard
- significant improvement
- improved algorithm
- dynamic programming
- preprocessing
- high accuracy
- optimal solution
- real time
- search space
- times faster
- path planning
- objective function
- segmentation algorithm
- computational complexity
- computational cost
- k means
- classification algorithm
- matching algorithm
- high dimensional
- bayesian networks