Two Access Methods Using Compact Binary Trees
IEEE Transactions on Software Engineering
S+-trees: an efficient structure for the representation of large pictures
CVGIP: Image Understanding
Finding neighbors on bincode-based images in O (n log log n) time
Pattern Recognition Letters
Efficient Parallel Manipulations of IBB Coded Imageson Meshes with Multiple Broadcasting
Journal of Mathematical Imaging and Vision
| Hi-index | 0.10 |
We first propose a modified S-tree. Let the memory required in the modified S-tree be O(m), then our derived fast search algorithm can be performed in O(t) time, t =