Coresets for minimum enclosing balls over sliding windows
Coresets are important tools to generate concise summaries of massive datasets for approximate analysis. A coreset is a small subset of points extracted from the original point set such that certain geometric properties are preserved with provable guarantees. This paper investigates the problem of m...
Saved in:
Main Authors: | WANG, Yanhao, LI, Yuchen, TAN, Kian-Lee |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2019
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4618 https://ink.library.smu.edu.sg/context/sis_research/article/5621/viewcontent/1905.03718.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Minimum coresets for maxima representation of multidimensional data
by: WANG, Yanhao, et al.
Published: (2021) -
Efficient representative subset selection over sliding windows
by: WANG, Yanhao, et al.
Published: (2018) -
A sliding-window framework for representative subset selection
by: WANG, Yanhao, et al.
Published: (2018) -
Efficient algorithms for the smallest enclosing ball problem
by: Zhou, G., et al.
Published: (2014) -
Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model
by: Daniel Anderson, et al.
Published: (2020)