Chenglin Fan

Orcid: 0009-0006-6454-907X

According to our database1, Chenglin Fan authored at least 45 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Differentially Private Multiway and k-Cut.
CoRR, 2024

A PTAS for <i>ℓ</i><sub>0</sub>-Low Rank Approximation: Solving Dense CSPs over Reals.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Robust Anomaly Detection for Offshore Wind Turbines: A Comparative Analysis of AESE Algorithm and Existing Techniques in SCADA Systems.
Proceedings of the 8th International Conference on Machine Learning and Soft Computing, 2024

2023
Fréchet Distance for Uncertain Curves.
ACM Trans. Algorithms, July, 2023

A PTAS for 𝓁<sub>0</sub>-Low Rank Approximation: Solving Dense CSPs over Reals.
CoRR, 2023

Faster Algorithms for Generalized Mean Densest Subgraph Problem.
CoRR, 2023

k-Median Clustering via Metric Embedding: Towards Better Initialization with Differential Privacy.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

LSDS++ : Dual Sampling for Accelerated k-means++.
Proceedings of the International Conference on Machine Learning, 2023

Improved Convergence of Differential Private SGD with Gradient Clipping.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
Breaking the Linear Error Barrier in Differentially Private Graph Distance Release.
CoRR, 2022

Metric Violation Distance: Hardness and Approximation.
Algorithmica, 2022

Private Graph All-Pairwise-Shortest-Path Distance Release with Improved Error Rate.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Near-Optimal Correlation Clustering with Privacy.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Metric Nearness with Minimum Distortion: Optimal and Approximation.
Proceedings of the IEEE Information Theory Workshop, 2022

Distances Release with Differential Privacy in Tree and Grid Graph.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Fitting Metrics and Ultrametrics with Minimum Disagreements.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

On Facility Location Problem in the Local Differential Privacy Model.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Skyline Diagram: Efficient Space Partitioning for Skyline Queries.
IEEE Trans. Knowl. Data Eng., 2021

Computing the Fréchet Gap Distance.
Discret. Comput. Geom., 2021

2020
Generalized Metric Repair on Graphs.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Classification Acceleration via Merging Decision Trees.
Proceedings of the FODS '20: ACM-IMS Foundations of Data Science Conference, 2020

Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2018
Cross-layer cooperative multichannel medium access for internet of things.
Peer-to-Peer Netw. Appl., 2018

Metric Violation Distance: Revisited and Extended.
CoRR, 2018

2016
On the General Chain Pair Simplification Problem.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Genomic Scaffold Filling Revisited.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
Expected computations on color spanning sets.
J. Comb. Optim., 2015

Complexity and Algorithms for the Discrete Fréchet Distance Upper Bound with Imprecise Input.
CoRR, 2015

Computing an Optimal Path with the Minimum Number of Distinct Sensors.
Proceedings of the Wireless Algorithms, Systems, and Applications, 2015

On the Chain Pair Simplification Problem.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014
Voronoi diagram with visual restriction.
Theor. Comput. Sci., 2014

On Some Proximity Problems of Colored Sets.
J. Comput. Sci. Technol., 2014

2013
On some geometric problems of color-spanning sets.
J. Comb. Optim., 2013

Tight Approximation Bounds for Connectivity with a Color-Spanning Set.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

On Some Proximity Problems of Colored Sets.
Proceedings of the Combinatorial Optimization and Applications, 2013

Expected Computations on Color Spanning Sets.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012
New models and efficient algorithms for hazard detection.
Proceedings of the 20th International Conference on Geoinformatics, 2012

2011
Continuous-Time Moving Network Voronoi Diagram.
Trans. Comput. Sci., 2011

Hide-and-Seek: Algorithms for Polygon Walk Problems.
Proceedings of the Theory and Applications of Models of Computation, 2011

Effective Privacy Preserved Clustering Based on Voronoi Diagram.
Proceedings of the Eighth International Symposium on Voronoi Diagrams in Science and Engineering, 2011

Half-Plane Voronoi Diagram.
Proceedings of the Eighth International Symposium on Voronoi Diagrams in Science and Engineering, 2011

On Some Geometric Problems of Color-Spanning Sets.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010
Moving Network Voronoi Diagram.
Proceedings of the Seventh International Symposium on Voronoi Diagrams in Science and Engineering, 2010

Fréchet-Distance on Road Networks.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

Point Location in the Continuous-Time Moving Network.
Proceedings of the Algorithmic Aspects in Information and Management, 2010


  Loading...