<--- Back to Details
First PageDocument Content
Binary trees / Segment tree / Collision detection / K-d tree / R-tree / Algorithm / Range tree / Selection algorithm / Interval tree / Graph theory / Computational geometry / Computing
Date: 2011-09-25 11:32:07
Binary trees
Segment tree
Collision detection
K-d tree
R-tree
Algorithm
Range tree
Selection algorithm
Interval tree
Graph theory
Computational geometry
Computing

Add to Reading List

Source URL: pub.ist.ac.at

Download Document from Source Website

File Size: 546,93 KB

Share Document on Facebook

Similar Documents

ATHERTON FACT SHEET | Work Segment 2.1, January 2018 PROJECT OVERVIEW TREE PRUNING AND REMOVAL ACTIVITES Over the last decade, Caltrain has experienced a substantial increase in

DocID: 1uA3y - View Document

Computer science / Computing / Theoretical computer science / Search algorithms / Computer programming / Interval tree / Segment tree / Range tree / FO / Lowest common ancestor / Bin / Level ancestor problem

Range Thresholding on Streams Miao Qiao Junhao Gan Yufei Tao

DocID: 1q8Ui - View Document

B-tree / Database index / Databases / Interval tree / Extensible Storage Engine / Data / B+ tree / Segment tree / Log-structured merge-tree / Range query / Fractal tree index / Bitmap index

Lightweight Indexing of Observational Data in Log-Structured Storage Sheng Wang #1 , David Maier †2 , Beng Chin Ooi #3 # National 1,3

DocID: 1pAcA - View Document

Interval tree / Segment tree / Interval / Inverted index / Ranking

Durable Top-k Search in Document Archives Leong Hou U† , Nikos Mamoulis† , Klaus Berberich‡ , Srikanta Bedathur‡ † Department of Computer Science, University of Hong Kong Pokfulam Road, Hong Kong

DocID: 1pvwg - View Document

Linear algebra / Sorting algorithms / Computational geometry / Cache / Models of computation / Line segment / Cache-oblivious algorithm / B-tree / Merge sort / Intersection / Trie / BentleyOttmann algorithm

Cache-Oblivious Red-Blue Line Segment Intersection Lars Arge1,? , Thomas Mølhave1,?? , and Norbert Zeh2,? ? ? 1 2

DocID: 1oV4U - View Document