EDBT 2026 Demo / reviewers in the wild / expert
Tingkai Sha
dblp:254/0057
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics › scatterplot
scatterplot matrix |
0.1 | 1 | 2020 | Data Sampling in Multi-view and Multi-class Scatterplots via Set Cover Optimization · IEEE Trans. Vis. Comput. Graph. 2020 |
Methods — techniques the papers use, named apart from their topics
space-filling curves · 0.4set cover optimization · 0.4coreset · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Data Sampling in Multi-view and Multi-class Scatterplots via Set Cover OptimizationabstractWe present a method for data sampling in scatterplots by jointly optimizing point selection for different views or classes. Our method uses space-filling curves (Z-order curves) that partition a point set into subsets that, when covered each by one sample, provide a sampling or coreset with good approximation guarantees in relation to the original point set. For scatterplot matrices with multiple views, different views provide different space-filling curves, leading to different partitions of the given point set. For multi-class scatterplots, the focus on either per-class distribution or global distribution provides two different partitions of the given point set that need to be considered in the selection of the coreset. For both cases, we convert the coreset selection problem into an Exact Cover Problem (ECP), and demonstrate with quantitative and qualitative evaluations that an approximate solution that solves the ECP efficiently is able to provide high-quality samplings. Ruizhen Hu, Tingkai Sha, Oliver van Kaick, Oliver Deussen, Hui Huang 0004 |
IEEE Trans. Vis. Comput. Graph. | 2 |