A Faster Algorithm for Enumerating Connected Convex Subgraphs in Acyclic Digraphs.
Shanshan WangChenglong XiaoWanjun LiuPublished in: IEEE Embed. Syst. Lett. (2017)
Keyphrases
- cost function
- clustering method
- np hard
- optimization algorithm
- convex hull
- significant improvement
- globally optimal
- objective function
- preprocessing
- detection algorithm
- worst case
- dynamic programming
- recognition algorithm
- piecewise linear
- experimental evaluation
- special case
- computational complexity
- learning algorithm
- highly efficient
- computationally demanding
- neural network
- tree structure
- segmentation algorithm
- probabilistic model
- computational cost
- k means