Pages that link to "Item:Q1235007"
From MaRDI portal
The following pages link to Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees (Q1235007):
Displayed 19 items.
- A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning (Q670431) (← links)
- Index structures for fast similarity search for real vectors. II (Q722065) (← links)
- An improved algorithm for the maximum agreement subtree problem (Q1041753) (← links)
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems (Q1124391) (← links)
- The extendible cell method for closest point problems (Q1161290) (← links)
- Average case analysis of region search in balanced k-d trees (Q1253931) (← links)
- Dynamic orthogonal range queries in OLAP. (Q1401285) (← links)
- K-d tree based approach for point location problem in explicit model predictive control (Q1661925) (← links)
- Fast model predictive control combining offline method and online optimization with K-D tree (Q1667126) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids (Q1894952) (← links)
- Fine-grained complexity theory: conditional lower bounds for computational geometry (Q2117766) (← links)
- A kd-tree-accelerated hybrid data-driven/model-based approach for poroelasticity problems with multi-fidelity multi-physics data (Q2237269) (← links)
- Ranked document selection (Q2297857) (← links)
- Information storage and search complexity theory (Q2453382) (← links)
- Chaining algorithms for multiple genome comparison (Q2569405) (← links)
- An application of $m$-ary trees to the design of data structures for geometric searching problems (Q4730791) (← links)
- A Measure-Theoretic Interpretation of Sample Based Numerical Integration with Applications to Inverse and Prediction Problems under Uncertainty (Q5358962) (← links)
- Optimal binary search trees (Q5906917) (← links)