default search action
Dongjing Miao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c20]Xiangyu Gao, Jianzhong Li, Dongjing Miao:
Computing All Restricted Skyline Probabilities on Uncertain Datasets. ICDE 2024: 4773-4786 - [c19]Huaiyuan Liu
, Xianzhang Liu
An Unsupervised Learning Framework Combined with Heuristics for the Maximum Minimal Cut Problem. KDD 2024: 1921-1932 - [i9]Zizheng Guo, Pengyu Chen, Yanzhang Fu, Dongjing Miao:
Data Debugging is NP-hard for Classifiers Trained with SGD. CoRR abs/2408.01365 (2024) - [i8]Huaiyuan Liu, Xianzhang Liu, Donghua Yang, Hongzhi Wang, Yingchi Long, Mengtong Ji, Dongjing Miao, Zhiyu Liang:
An Unsupervised Learning Framework Combined with Heuristics for the Maximum Minimal Cut Problem. CoRR abs/2408.08484 (2024) - 2023
- [j22]Chengliang Chai
GoodCore: Data-effective and Data-efficient Machine Learning through Coreset Selection over Incomplete Data. Proc. ACM Manag. Data 1(2): 157:1-157:27 (2023) - [j21]Dongjing Miao
Deletion Propagation Revisited for Multiple Key Preserving Views. IEEE Trans. Knowl. Data Eng. 35(3): 2445-2456 (2023) - [j20]Dongjing Miao
Approximation and inapproximability results on computing optimal repairs. VLDB J. 32(1): 173-197 (2023) - [j19]Zemin Chao, Hong Gao, Dongjing Miao, Hongzhi Wang:
Discovering time series motifs of all lengths using dynamic time warping. World Wide Web (WWW) 26(6): 3815-3836 (2023) - [c18]Junqi Tan, Dongjing Miao, Pengyu Chen:
The MaxIS-Shapley Value in Perfect Graphs. COCOA (1) 2023: 196-210 - [i7]Pengyu Chen, Dongjing Miao, Weitian Tong, Zizheng Guo, Jianzhong Li, Zhipeng Cai:
Random-Order Enumeration for Self-Reducible NP-Problems. CoRR abs/2302.13549 (2023) - [i6]Xiangyu Gao, Jianzhong Li, Dongjing Miao:
Computing All Restricted Skyline Probabilities for Uncertain Data. CoRR abs/2303.00259 (2023) - [i5]Jianfeng Huang, Dongjing Miao, Xin Liu:
QUEST: An Efficient Query Evaluation Scheme Towards Scan-Intensive Cross-Model Analysis. CoRR abs/2309.11860 (2023) - 2022
- [j18]Kunyi Chen
Combine Data Collecting and Task Computing: Progressive Computing in Internet of Things. IEEE Internet Things J. 9(13): 10936-10947 (2022) - [j17]Meng Han
A balm: defend the clique-based attack from a fundamental aspect. J. Comb. Optim. 44(3): 1637-1658 (2022) - [j16]Xiangyu Gao
Sublinear-time reductions for big data computing. Theor. Comput. Sci. 932: 1-12 (2022) - [c17]Xiangyu Gao
Dynamic Approximate Maximum Independent Set on Massive Graphs. ICDE 2022: 1835-1847 - [e1]Yong Zhang, Dongjing Miao, Rolf H. Möhring:
Computing and Combinatorics - 28th International Conference, COCOON 2022, Shenzhen, China, October 22-24, 2022, Proceedings. Lecture Notes in Computer Science 13595, Springer 2022, ISBN 978-3-031-22104-0 [contents] - 2021
- [j15]Kedong Yan, Dongjing Miao, Cui Guo, Chanying Huang
Efficient feature selection for logical analysis of large-scale multi-class datasets. J. Comb. Optim. 42(1): 1-23 (2021) - [c16]Xiangyu Gao, Jian-Zhong Li, Dongjing Miao:
Sublinear-Time Reductions for Big Data Computing. COCOA 2021: 374-388 - [i4]Xiangyu Gao, Jianzhong Li, Dongjing Miao:
Sublinear-time Reductions for Big Data Computing. CoRR abs/2111.15330 (2021) - 2020
- [j14]Dongjing Miao, Zhipeng Cai, Jianzhong Li, Xiangyu Gao, Xianmin Liu:
The Computation of Optimal Subset Repairs. Proc. VLDB Endow. 13(11): 2061-2074 (2020) - [j13]Dongjing Miao, Jiguo Yu, Zhipeng Cai
The hardness of resilience for nested aggregation query. Theor. Comput. Sci. 803: 152-159 (2020) - [j12]Dongjing Miao, Zhipeng Cai
Functional dependency restricted insertion propagation. Theor. Comput. Sci. 819: 1-8 (2020) - [j11]Xiangyu Gao
Recognizing the tractability in big data computing. Theor. Comput. Sci. 838: 195-207 (2020) - [j10]Dongjing Miao, Jianzhong Li, Zhipeng Cai
Maximum reachability preserved graph cut. Theor. Comput. Sci. 840: 187-198 (2020) - [j9]Dongjing Miao, Jianzhong Li, Zhipeng Cai
The parameterized complexity and kernelization of resilience for database queries. Theor. Comput. Sci. 840: 199-211 (2020) - [c15]Dongjing Miao
New Results on the Complexity of Deletion Propagation. AAIM 2020: 336-345 - [c14]Mingyue Ji, Xiukun Wei, Dongjing Miao:
Threshold Functional Dependencies for Time Series Data. DASFAA (Workshops) 2020: 164-174 - [i3]Dongjing Miao, Zhipeng Cai, Jianzhong Li, Xiangyu Gao, Xianmin Liu:
Complexity and Efficient Algorithms for Data Inconsistency Evaluating and Repairing. CoRR abs/2001.00315 (2020) - [i2]Xiangyu Gao, Jianzhong Li, Dongjing Miao, Xianmin Liu:
Dynamic Near Maximum Independent Set with Time Independent of Graph Size. CoRR abs/2009.11435 (2020)
2010 – 2019
- 2019
- [j8]Dongjing Miao
Vertex cover in conflict graphs. Theor. Comput. Sci. 774: 103-112 (2019) - [j7]Dongjing Miao
Triangle edge deletion on planar glasses-free RGB-digraphs. Theor. Comput. Sci. 788: 2-11 (2019) - [c13]Xiangyu Gao, Jianzhong Li, Dongjing Miao, Xianmin Liu:
Recognizing the Tractability in Big Data Computing. COCOA 2019: 223-234 - [c12]Dongjing Miao, Zhipeng Cai
On the Hardness of Reachability Reduction. COCOON 2019: 445-455 - [c11]Zhipeng Cai
Deletion Propagation for Multiple Key Preserving Conjunctive Queries: Approximations and Complexity. ICDE 2019: 506-517 - [i1]Xiangyu Gao, Jianzhong Li, Dongjing Miao, Xianmin Liu:
Recognizing the Tractability in Big Data Computing. CoRR abs/1910.01357 (2019) - 2018
- [j6]Dongjing Miao, Zhipeng Cai
SEF view deletion under bounded condition. Theor. Comput. Sci. 749: 17-25 (2018) - [j5]Xianmin Liu
Tree size reduction with keeping distinguishability. Theor. Comput. Sci. 749: 26-35 (2018) - [j4]Dongjing Miao
On the Complexity of Bounded View Propagation for Conjunctive Queries. IEEE Trans. Knowl. Data Eng. 30(1): 115-127 (2018) - [c10]Meng Han, Dongjing Miao, Jinbao Wang, Liyuan Liu:
Defend the Clique-based Attack for Data Privacy. COCOA 2018: 262-280 - [c9]Dongjing Miao, Zhipeng Cai
On the Complexity of Resilience for Aggregation Queries. COCOA 2018: 696-706 - [c8]Madhuri Siddula, Zhipeng Cai
Privacy Preserving Online Social Networks using Enhanced Equicardinal Clustering. IPCCC 2018: 1-8 - 2017
- [j3]Dongjing Miao, Zhipeng Cai
Approximation for vertex cover in β-conflict graphs. J. Comb. Optim. 34(4): 1052-1059 (2017) - [j2]An Wan, Jing Xu, Dongjing Miao, Ken Chen:
An Accurate Point-Based Rigid Registration Method for Laser Tracker Relocation. IEEE Trans. Instrum. Meas. 66(2): 254-262 (2017) - [c7]Dongjing Miao, Zhipeng Cai
A Refined Characteristic of Minimum Contingency Set for Conjunctive Query. COCOA (1) 2017: 251-264 - [c6]Dongjing Miao, Zhipeng Cai
Parameterized Complexity of Resilience Decision for Database Debugging. ICFEM 2017: 332-344 - 2016
- [j1]Dongjing Miao
On the complexity of sampling query feedback restricted database repair of functional dependency violations. Theor. Comput. Sci. 609: 594-605 (2016) - [c5]Xianmin Liu, Zhipeng Cai
On the Complexity of Extracting Subtree with Keeping Distinguishability. COCOA 2016: 230-240 - [c4]Dongjing Miao, Yingshu Li, Xianmin Liu, Jianzhong Li:
On the Complexity of Bounded Deletion Propagation. COCOA 2016: 453-462 - [c3]Dongjing Miao, Zhipeng Cai
On the Complexity of Insertion Propagation with Functional Dependency Constraints. COCOON 2016: 623-632 - 2015
- [c2]Dongjing Miao, Jianzhong Li, Xianmin Liu, Hong Gao:
Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation. COCOA 2015: 395-408 - 2014
- [c1]Dongjing Miao, Xianmin Liu, Jianzhong Li:
Sampling Query Feedback Restricted Repairs of Functional Dependency Violations: Complexity and Algorithm. COCOON 2014: 37-48
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: