Minimum coresets for maxima representation of multidimensional data
Coresets are succinct summaries of large datasets such that, for a given problem, the solution obtained from a coreset is provably competitive with the solution obtained from the full dataset. As such, coreset-based data summarization techniques have been successfully applied to various problems, e....
Saved in:
Main Authors: | WANG, Yanhao, MATHIOUDAKIS, Michael, LI, Yuchen, TAN, Kian-Lee |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2021
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/6202 https://ink.library.smu.edu.sg/context/sis_research/article/7205/viewcontent/3452021.3458322.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A fast algorithm for convex hull extraction in 2D images
by: Ye, Q.-Z.
Published: (2014) -
A fully dynamic algorithm for k-regret minimizing sets
by: WANG, Yanhao, et al.
Published: (2021) -
Coresets for minimum enclosing balls over sliding windows
by: WANG, Yanhao, et al.
Published: (2019) -
Minimizing the regret of an influence provider
by: ZHANG, Yipeng, et al.
Published: (2021) -
Induction of mineralization by nacreous water-soluble matrix of Pinctada maxima in cultured human dental pulpal cells
by: Titikan Laothumthut
Published: (2023)