Demo Data from EDBT 2026 / reviewers in the wild / expert
Xingni Li
dblp:207/3958
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0002-6395-1706ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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 architecture, parallel and distributed computing, and storage systems
1 paper |
Memory systems · 50% Cloud and datacenter computing · 50% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cloud and datacenter computing › big data analytics
in-memory data analytics |
0.4 | 1 | 2020 | Downsizing Without Downgrading: Approximated Dynamic Time Warping on Nonvolatile Memories · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020 |
Memory systems
non-volatile memory |
0.4 | 1 | 2020 | Downsizing Without Downgrading: Approximated Dynamic Time Warping on Nonvolatile Memories · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020 |
Algorithms and data structures › sequence algorithms
dynamic time warping |
0.4 | 1 | 2020 | Downsizing Without Downgrading: Approximated Dynamic Time Warping on Nonvolatile Memories · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020 |
Methods — techniques the papers use, named apart from their topics
dynamic time warping · 0.9downsampling · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Downsizing Without Downgrading: Approximated Dynamic Time Warping on Nonvolatile MemoriesabstractIn recent years, time-series data have emerged in a variety of application domains, such as wireless sensor networks and surveillance systems. To identify the similarity between time-series data, the Euclidean distance and its variations are common metrics that quantify the differences between time-series data. However, the Euclidean distance is limited by its inability to elastically shift with the time axis, which motivates the development of dynamic time warping (DTW) algorithms. While DTW algorithms have been proven very useful in diversified applications like speech recognition, their efficacy might be seriously affected by the resolution of the time-series data. However, high-resolution time-series data might take up a gigantic amount of main memory and storage space, which will slow down the DTW analysis procedure. This makes the upscaling of DTW analysis more challenging, especially for in-memory data analytics platforms with limited nonvolatile memory space. In this paper, we propose a strategy to downsample time-series data to significantly reduce their size without seriously affecting the precision of the results obtained by DTW algorithms (downsizing without downgrading). In other words, this paper proposes a technique to remove the unimportant details that are largely ignored by DTW algorithms. The efficacy of the proposed technique is verified by a series of experimental studies, where the results are quite encouraging. Duo Liu 0002, Xingni Li, Po-Chun Huang, Yingjian Ling, Kan Zhong, Renping Liu 0002, Xianzhang Chen, Liang Liang 0002 |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 2 |