30 Papers
36 Citations
Chao Pan is an academic researcher from University of Illinois at Urbana–Champaign. The author has contributed to research in topics: Computer science & Space (mathematics). The author has an hindex of 4, co-authored 14 publications.
Chat about Author
Papers
Detecting topological variations of DNA at single-molecule level
Ke Liu,Chao Pan,Alexandre Kuhn,Adrian P. Nievergelt,Georg E. Fantner,Olgica Milenkovic,Aleksandra Radenovic +6 more
TL;DR: Barcoded DNA is used to characterise the translocation profiles of DNA with single strand gaps to achieve improved multi-level signal detection and consequent extraction of reliable information about topological variations.
•Proceedings Article
Spatio-Temporal Graph Scattering Transform
Chao Pan,Siheng Chen,Antonio Ortega +2 more
- 03 May 2021
TL;DR: The proposed ST-GST performs iterative applications of spatio-temporal graph wavelets and nonlinear activation functions, and is promising for the real-world scenarios with limited training data, and also allows for a theoretical analysis, which shows that the proposed ST -GST is stable to small perturbations of input signals and structures.
•Proceedings Article
Query K-means Clustering and the Double Dixie Cup Problem
I Chien,Chao Pan,Olgica Milenkovic +2 more
- 01 Jan 2018
TL;DR: In this paper, the authors consider the problem of approximate K-means clustering with outliers and side information provided by same-cluster queries and possibly noisy answers, and show that under some mild assumptions on the smallest cluster size, one can obtain an $(1+\epsilon)$-approximation for the optimal potential with probability at least $1-delta.
Rewritable Two-Dimensional DNA-Based Data Storage with Machine Learning Reconstruction
Chao Pan,S Kasra Tabatabaei,S. M. Hossein Tabatabaei Yazdi,Alvaro G. Hernandez,Charles M. Schroeder,Olgica Milenkovic +5 more
TL;DR: In this paper, a two-dimensional molecular data storage system that records information in both the sequence and the backbone structure of DNA was proposed, which can serve both as a write-once and rewritable memory for heterogenous data.
10
•Posted Content
Query K-means Clustering and the Double Dixie Cup Problem
TL;DR: The problem of approximate K-means clustering with outliers and side information provided by same-cluster queries and possibly noisy answers is considered, and the solution shows that, under some mild assumptions on the smallest cluster size, one can obtain an $(1+\epsilon)-approximation for the optimal potential with probability at least $1-\delta".
4