Scaled Fenwick Trees
A novel data structure that enables the storage and retrieval of linear array numeric data with logarithmic time complexity updates, range sums, and rescaling is introduced and studied. Computing sums of ranges of arrays of numbers is a common computational problem encountered in data compression, c...
Saved in:
| Main Author: | Matthew Cushman |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2023-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10196100/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
BAYESIAN ADDITIVE REGRESSION TREE APPLICATION FOR PREDICTING MATERNITY RECOVERY RATE OF GROUP LONG-TERM DISABILITY INSURANCE
by: Stevanny Budiana, et al.
Published: (2023-04-01) -
Generalized H-fold sumset and Subsequence sum
by: Mohan, et al.
Published: (2024-02-01) -
Quality of service optimization algorithm based on deep reinforcement learning in software defined network
by: Cenhuishan LIAO, et al.
Published: (2023-03-01) -
Nonzero-Sum Time Perception Is Associated with Greater Willingness to Help
by: Yu Niiya, et al.
Published: (2025-05-01) -
Direct sum of Intuitionistic fuzzy quasi injective s-act
by: Jeehan Sabah Mahmood, et al.
Published: (2025-04-01)