A Hessenberg-type Algorithm for Computing PageRank Problems.
Xian-Ming GuSiu-Long LeiKe ZhangZhao-Li ShenChun WenBruno CarpentieriPublished in: CoRR (2019)
Keyphrases
- benchmark problems
- objective function
- test problems
- computational cost
- np hard
- detection algorithm
- dynamic programming
- search space
- computational complexity
- probabilistic model
- iterative algorithms
- times faster
- matching algorithm
- theoretical analysis
- improved algorithm
- recognition algorithm
- combinatorial optimization
- clustering method
- learning algorithm
- computationally efficient
- np complete
- segmentation algorithm
- random walk
- path planning
- linear programming
- convex hull
- simulated annealing
- worst case
- k means
- optimal solution
- data sets
- optimal or near optimal