A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs.
Kou HamadaSankardeep ChakrabortySeungbum JoTakuto KoriyamaKunihiko SadakaneSrinivasa Rao SattiPublished in: CoRR (2024)
Keyphrases
- efficient implementation
- average case
- worst case
- worst case analysis
- competitive ratio
- active set
- hardware implementation
- uniform distribution
- upper bound
- optimal solution
- efficient processing
- highly parallel
- pairwise
- data sets
- learning curves
- lower bound
- vc dimension
- approximation algorithms
- theoretical analysis
- dynamic programming
- special case
- training data