Cramér-Rao lower bound analysis of RSS/TDoA joint localization algorithms based on rigid graph theory.
Heng XuQiyue LiJianping WangJunyi YangWei SunPublished in: Ad Hoc Networks (2020)
Keyphrases
- graph theory
- lower bound
- graph based representations
- maximal cliques
- social network analysis
- graph theoretic
- worst case
- graph theoretical
- upper bound
- computer vision and pattern recognition
- complex networks
- minimum spanning tree
- maximal clique enumeration
- maximum independent set
- graph representations
- document similarity
- computational complexity
- objective function
- lower and upper bounds
- branch and bound algorithm
- combinatorial optimization
- protein structure prediction
- optimization problems
- np hard
- search algorithm
- optimal solution
- community mining
- automata theory
- social networks
- neural network