Instruct: Given a paper title, retrieve paper titles that are cited by the given paper.
Query: Adaptive and Approximate Orthogonal Range Counting
Geometric Range Searching and Its Relatives
Fast and Scalable Range Query Processing With Strong Privacy Protection for Cloud Computing
Algorithms for the Orthographic-n-Point Problem
A Privacy-Preserving Index for Range Queries
Approximation schemes for covering and packing problems in image processing and VLSI
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Web data retrieval: solving spatial range queries using k-nearest neighbor searches
Approximate Computing: A Survey
Enhanced Nearest Neighbour Search on the R-tree
A Fast 2-Approximation Algorithm for Guarding Orthogonal Terrains
Geometric approximation via coresets
Towards Optimal Cardinality Estimation of Unions and Intersections with Sketches
Monte-Carlo approximation algorithms for enumeration problems
A fast randomized algorithm for orthogonal projection
Performance of Point and Range Queries for In-memory Databases Using Radix Trees on GPUs
Secure multidimensional range queries over outsourced data
An Improved Construction for Counting Bloom Filters
Composite Quantization for Approximate Nearest Neighbor Search
Dual Marching Squares: Description and analysis
Cardinality estimation and dynamic length adaptation for Bloom filters
3-D Rail-Wheel contact analysis using FEA
CT-index: Fingerprint-based graph indexing combining cycles and trees
Revisit of Minimum-area Enclosing Rectangle of a Convex Polygon
A 32-Gb/s backplane transceiver with on-chip AC-coupling and low latency CDR in 32-nm SOI CMOS technology
analysis of n - dimensional quadtrees using the hausdorff fractal dimension .