Instruct: Given a paper title, retrieve paper titles that are cited by the given paper
Query: A space-optimal data-stream algorithm for coresets in the plane
Coresets in dynamic geometric data streams
Coresets for polytope distance
Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering
Approximate clustering via core-sets
Coresets and sketches for high dimensional subspace approximation problems
Dimensionality Reduction of Massive Sparse Datasets Using Coresets
Approximation schemes for Euclidean k-medians and related problems
Communication Efficient Coresets for Empirical Loss Minimization
Parameterized Streaming Algorithms for Vertex Cover
Approximate Convex Hull of Data Streams
Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
Approximation Algorithms for Submodular Set Cover with Applications
An Algorithm for Optimal Partitioning of Data on an Interval
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
Approximation algorithms for data placement in arbitrary networks
Placement Strategies for Internet-Scale Data Stream Systems
Divide-and-conquer approximation algorithms via spreading metrics
Random sampling techniques for space efficient online computation of order statistics of large datasets
Approximatingk-center in planar graphs
Improved Guarantees for Vertex Sparsification in Planar Graphs
Conservative treatment of carpal tunnel syndrome: comparison between laser therapy and Fascial Manipulation(®).
Indexing and mining free trees
Exploration of the effectiveness of expectation maximization algorithm for suspicious transaction detection in anti-money laundering
A Siamese inception architecture network for person re-identification
Processing set expressions over continuous update streams