An IPv6 routing lookup algorithm based on subsection intensive compression and multi-branch tree.
Yan PanZhonghe WeiJianxiu ZhaoMin GuoPublished in: ICIA (2017)
Keyphrases
- learning algorithm
- objective function
- preprocessing
- computational complexity
- search space
- cost function
- detection algorithm
- tree structure
- np hard
- times faster
- lower bound
- k means
- data compression
- tree construction
- binary tree
- classification trees
- suffix tree
- segmentation algorithm
- expectation maximization
- image compression