On the performance of the free-access tree algorithm with MPR, SIC, and single-slot memory.
Cedomir StefanovicMarko BekoDejan VukobratovicPublished in: Ad Hoc Networks (2024)
Keyphrases
- memory usage
- dynamic programming
- learning algorithm
- tree structure
- memory requirements
- cost function
- worst case
- detection algorithm
- recognition algorithm
- times faster
- similarity measure
- binary tree
- theoretical analysis
- optimization algorithm
- high accuracy
- improved algorithm
- convergence rate
- objective function
- expectation maximization
- minimum spanning tree
- optimal solution
- hardware implementation
- graph structure
- preprocessing
- associative memory
- search space
- k means
- np hard
- segmentation algorithm
- particle swarm optimization