A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons.
Binay BhattacharyaAmirhossein MozafariThomas C. ShermerPublished in: COCOON (2) (2023)
Keyphrases
- computational complexity
- objective function
- learning algorithm
- optimal solution
- np hard
- detection algorithm
- theoretical analysis
- expectation maximization
- k means
- dynamic programming
- experimental evaluation
- high accuracy
- preprocessing
- significant improvement
- cost function
- computational cost
- improved algorithm
- segmentation algorithm
- similarity measure
- times faster
- tree structure
- similarity function
- localization algorithm
- convex hull
- clustering method
- computationally efficient
- search space
- pairwise
- clustering algorithm