| Under-Display Camera Image Enhancement via Cascaded Curve Estimation | 0 | 0.34 | 2022 |
| Group-based Skyline for Pareto Optimal Groups | 0 | 0.34 | 2021 |
| Eclipse: Generalizing kNN and Skyline | 0 | 0.34 | 2021 |
| Skyline Diagram: Finding the Voronoi Counterpart for Skyline Queries | 3 | 0.37 | 2018 |
| Eclipse: Practicability Beyond 1NN and Skyline. | 0 | 0.34 | 2017 |
| PurTreeClust: A purchase tree clustering algorithm for large-scale customer transaction data | 2 | 0.39 | 2016 |
| VPIndexer: velocity-based partitioning for indexing moving objects. | 1 | 0.35 | 2015 |
| Finding Pareto Optimal Groups: Group-based Skyline. | 14 | 0.55 | 2015 |
| Finding Probabilistic k-Skyline Sets on Uncertain Data | 8 | 0.45 | 2015 |
| Identifying and Analyzing Popular Phrases Multi-Dimensionally in Social Media Data | 4 | 0.40 | 2015 |
| Finding Pareto Optimal Groups: Group-based Skyline. | 0 | 0.34 | 2015 |
| Detecting and Analyzing Influenza Epidemics with Social Media in China. | 1 | 0.35 | 2014 |
| Locating POS Terminals from Credit Card Transactions | 0 | 0.34 | 2014 |
| Privacy Preserving Publication of Locations Based on Delaunay Triangulation. | 0 | 0.34 | 2014 |
| Speed Partitioning for Indexing Moving Objects. | 4 | 0.41 | 2014 |
| On some geometric problems of color-spanning sets | 10 | 0.63 | 2013 |
| Largest area convex hull of imprecise data based on axis-aligned squares | 2 | 0.37 | 2013 |
| Semantic Security: Privacy Definitions Revisited. | 1 | 0.36 | 2013 |
| A privacy framework: indistinguishable privacy | 2 | 0.36 | 2013 |
| On Some Proximity Problems of Colored Sets. | 1 | 0.35 | 2013 |
| Tight Approximation Bounds for Connectivity with a Color-Spanning Set. | 1 | 0.36 | 2013 |
| Expected Computations on Color Spanning Sets. | 4 | 0.48 | 2013 |
| A data-driven approach for convergence prediction on road network | 1 | 0.35 | 2013 |
| Finding frequent sub-trajectories with time constraints | 0 | 0.34 | 2013 |
| Multi-Layer network for influence propagation over microblog | 4 | 0.41 | 2012 |
| Processing aggregated data: the location of clusters in health data | 3 | 0.39 | 2012 |
| Privacy Preserving Distributed DBSCAN Clustering. | 8 | 0.53 | 2012 |
| Voronoi diagram with visual restriction. | 1 | 0.35 | 2012 |
| Relationships between geographical cluster and cyberspace community: A case study on microblog | 1 | 0.34 | 2012 |
| On some geometric problems of color-spanning sets | 2 | 0.42 | 2011 |
| Largest area convex hull of axis-aligned squares based on imprecise data | 0 | 0.34 | 2011 |
| Continuous-time moving network voronoi diagram | 1 | 0.36 | 2011 |
| Half-Plane Voronoi Diagram | 2 | 0.38 | 2011 |
| Detecting Commuting Patterns by Clustering Subtrajectories | 43 | 1.95 | 2011 |
| Rating: Privacy Preservation for Multiple Attributes with Different Sensitivity Requirements | 9 | 0.59 | 2011 |
| A practical solution for aligning and simplifying pairs of protein backbones under the discrete fréchet distance | 4 | 0.45 | 2011 |
| An Active Compensation System for Robot Vision in Rough Environment Based on Bionic Eye. | 0 | 0.34 | 2011 |
| Info-cluster based regional influence analysis in social networks | 1 | 0.38 | 2011 |
| Effective Privacy Preserved Clustering Based on Voronoi Diagram | 1 | 0.36 | 2011 |
| Hide-and-Seek: Algorithms for Polygon Walk Problems | 0 | 0.34 | 2011 |
| Finding long and similar parts of trajectories | 25 | 0.95 | 2011 |
| Approximation algorithm for the largest area convex hull of same size non-overlapping axis-aligned squares | 0 | 0.34 | 2010 |
| Moving Network Voronoi Diagram | 1 | 0.37 | 2010 |
| NP-Completeness of Spreading Colored Points | 2 | 0.38 | 2010 |
| Minimum Spanning Tree Based Classification Model for Massive Data with MapReduce Implementation | 4 | 0.40 | 2010 |
| Mining trajectory corridors using fréchet distance and meshing grids | 7 | 0.52 | 2010 |
| Point location in the continuous-time moving network | 0 | 0.34 | 2010 |
| Fréchet-Distance on road networks | 1 | 0.36 | 2010 |
| Stabbing balls and simplifying proteins. | 0 | 0.34 | 2009 |
| New Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Line Segment Model | 3 | 0.42 | 2009 |
