1 citations · 2 across the 6 of their papers we have counts for
6 papers
Computing All Restricted Skyline Probabilities on Uncertain Datasets
Xiangyu Gao, Jianzhong Li, Dongjing Miao
Restricted skyline (rskyline) query is widely used in multi-criteria decision making. It generalizes the skyline query by additionally considering a set of personalized scoring fun…
Random-Order Enumeration for Self-Reducible NP-Problems
Pengyu Chen, Dongjing Miao, Weitian Tong +3
In plenty of data analysis tasks, a basic and time-consuming process is to produce a large number of solutions and feed them into downstream processing. Various enumeration algorit…
Sublinear-time Reductions for Big Data Computing
Xiangyu Gao, Jianzhong Li, Dongjing Miao
With the rapid popularization of big data, the dichotomy between tractable and intractable problems in big data computing has been shifted. Sublinear time, rather than polynomial t…
Dynamic Approximate Maximum Independent Set on Massive Graphs
Xiangyu Gao, Jianzhong Li, Dongjing Miao
Computing a maximum independent set (MaxIS) is a fundamental NP-hard problem in graph theory, which has important applications in a wide spectrum of fields. Since graphs in many ap…
Complexity and Efficient Algorithms for Data Inconsistency Evaluating and Repairing
Dongjing Miao, Zhipeng Cai, Jianzhong Li +2
Data inconsistency evaluating and repairing are major concerns in data quality management. As the basic computing task, optimal subset repair is not only applied for cost estimatio…
Recognizing the Tractability in Big Data Computing
Xiangyu Gao, Jianzhong Li, Dongjing Miao +1
Due to the limitation on computational power of existing computers, the polynomial time does not works for identifying the tractable problems in big data computing. This paper adop…