Dongjing Miao

Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

2023

Discovering time series motifs of all lengths using dynamic time warping.

[BibT_eX]

[DOI]

World Wide Web (WWW), November, 2023

Deletion Propagation Revisited for Multiple Key Preserving Views.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., March, 2023

Approximation and inapproximability results on computing optimal repairs.

[BibT_eX]

[DOI]

VLDB J., January, 2023

GoodCore: Data-effective and Data-efficient Machine Learning through Coreset Selection over Incomplete Data.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

QUEST: An Efficient Query Evaluation Scheme Towards Scan-Intensive Cross-Model Analysis.

[BibT_eX]

[DOI]

Jianfeng Huang

Xin Liu

CoRR, 2023

Computing All Restricted Skyline Probabilities for Uncertain Data.

[BibT_eX]

[DOI]

CoRR, 2023

Random-Order Enumeration for Self-Reducible NP-Problems.

[BibT_eX]

[DOI]

CoRR, 2023

The MaxIS-Shapley Value in Perfect Graphs.

[BibT_eX]

[DOI]

Junqi Tan

Pengyu Chen

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

Sublinear-time reductions for big data computing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

A balm: defend the clique-based attack from a fundamental aspect.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Combine Data Collecting and Task Computing: Progressive Computing in Internet of Things.

[BibT_eX]

[DOI]

IEEE Internet Things J., 2022

Dynamic Approximate Maximum Independent Set on Massive Graphs.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021

Efficient feature selection for logical analysis of large-scale multi-class datasets.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

2020

The hardness of resilience for nested aggregation query.

[BibT_eX]

[DOI]

Jiguo Yu

Theor. Comput. Sci., 2020

The parameterized complexity and kernelization of resilience for database queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Maximum reachability preserved graph cut.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Functional dependency restricted insertion propagation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Recognizing the tractability in big data computing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

The Computation of Optimal Subset Repairs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Dynamic Near Maximum Independent Set with Time Independent of Graph Size.

[BibT_eX]

[DOI]

CoRR, 2020

Complexity and Efficient Algorithms for Data Inconsistency Evaluating and Repairing.

[BibT_eX]

[DOI]

CoRR, 2020

Threshold Functional Dependencies for Time Series Data.

[BibT_eX]

[DOI]

Mingyue Ji

Xiukun Wei

Proceedings of the Database Systems for Advanced Applications. DASFAA 2020 International Workshops, 2020

New Results on the Complexity of Deletion Propagation.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

Vertex cover in conflict graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Triangle edge deletion on planar glasses-free RGB-digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Deletion Propagation for Multiple Key Preserving Conjunctive Queries: Approximations and Complexity.

[BibT_eX]

[DOI]

Yingshu Li

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

On the Hardness of Reachability Reduction.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

On the Complexity of Bounded View Propagation for Conjunctive Queries.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2018

SEF view deletion under bounded condition.

[BibT_eX]

[DOI]

Yingshu Li

Theor. Comput. Sci., 2018

Tree size reduction with keeping distinguishability.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Privacy Preserving Online Social Networks using Enhanced Equicardinal Clustering.

[BibT_eX]

[DOI]

Madhuri Siddula

Proceedings of the 37th IEEE International Performance Computing and Communications Conference, 2018

On the Complexity of Resilience for Aggregation Queries.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

Defend the Clique-based Attack for Data Privacy.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

An Accurate Point-Based Rigid Registration Method for Laser Tracker Relocation.

[BibT_eX]

[DOI]

IEEE Trans. Instrum. Meas., 2017

Approximation for vertex cover in β-conflict graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Parameterized Complexity of Resilience Decision for Database Debugging.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods and Software Engineering, 2017

A Refined Characteristic of Minimum Contingency Set for Conjunctive Query.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

On the complexity of sampling query feedback restricted database repair of functional dependency violations.

[BibT_eX]

[DOI]

Xianmin Liu

Theor. Comput. Sci., 2016

On the Complexity of Insertion Propagation with Functional Dependency Constraints.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

On the Complexity of Bounded Deletion Propagation.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

On the Complexity of Extracting Subtree with Keeping Distinguishability.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Sampling Query Feedback Restricted Repairs of Functional Dependency Violations: Complexity and Algorithm.

[BibT_eX]

[DOI]

Xianmin Liu