Jianzhong Li

From MaRDI portal
Person:946655

Available identifiers

zbMath Open li.jianzhongMaRDI QIDQ946655

List of research outcomes





PublicationDate of PublicationType
Towards strong regret minimization sets: balancing freshness and diversity in data selection2025-01-08Paper
Approximation algorithms for finding maximum containing circle and sphere2024-12-12Paper
Multiple-model polynomial regression and efficient algorithms for data analysis2024-11-18Paper
A novel approximation algorithm for max-covering circle problem2024-09-16Paper
Testing higher-order clusterability on graphs2024-09-16Paper
An efficient data analysis method for big data using multiple-model linear regression2024-08-22Paper
The hardness of optimization problems on the weighted massively parallel computation model2024-08-22Paper
Diversity and freshness-aware regret minimizing set queries2024-08-22Paper
Approximate sorting and its applications in I/O model2024-03-01Paper
Efficient computation of G-skyline groups on massive data2024-02-16Paper
Turing machines with two-level memory: new computational models for analyzing the input/output complexity2024-01-08Paper
Leave or not leave? Group members' departure prediction in dynamic information networks2023-11-23Paper
Turing machines with two-level memory: a deep look into the input/output complexity2023-08-10Paper
Approximate sorting and its applications in I/O model2023-08-10Paper
A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee2023-03-21Paper
Selecting sources for query approximation with bounded resources2023-03-21Paper
Sampling-based approximate skyline calculation on big data2023-03-21Paper
Sampling-based approximate skyline calculation on big data2022-12-19Paper
Data source selection for approximate query2022-10-18Paper
Sublinear-time reductions for big data computing2022-09-16Paper
Sublinear-time reductions for big data computing2022-06-29Paper
Efficient top-\(k\) high utility itemset mining on massive data2022-04-19Paper
https://portal.mardi4nfdi.de/entity/Q50172252021-12-17Paper
On the complexity and approximability of repair position selection problem2021-11-25Paper
Range partitioning within sublinear time in the external memory model2021-07-05Paper
New results on the complexity of deletion propagation2021-07-05Paper
How hard is completeness reasoning for conjunctive queries?2021-04-21Paper
Parameterized complexity of completeness reasoning for conjunctive queries2021-04-08Paper
Existence of traveling waves for a nonlocal dispersal SIR epidemic model with treatment2021-04-01Paper
Learned sketches for frequency estimation2021-03-18Paper
A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee2021-01-25Paper
Range partitioning within sublinear time: algorithms and lower bounds2021-01-25Paper
Vaginal secretions epithelial cells and bacteria recognition based on computer vision2020-12-18Paper
Maximum reachability preserved graph cut2020-09-17Paper
The parameterized complexity and kernelization of resilience for database queries2020-09-17Paper
Parallel algorithms for flexible pattern matching on big graphs2020-09-08Paper
Recognizing the tractability in big data computing2020-09-01Paper
A true \(O(n\log{n})\) algorithm for the all-\(k\)-nearest-neighbors problem2020-05-13Paper
Recognizing the tractability in big data computing2020-05-13Paper
Functional dependency restricted insertion propagation2020-04-08Paper
An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN2019-12-27Paper
An algorithm for reducing approximate nearest neighbor to approximate near neighbor with \(O(\log{n})\) query time2019-10-11Paper
https://portal.mardi4nfdi.de/entity/Q51957502019-10-02Paper
https://portal.mardi4nfdi.de/entity/Q51941952019-09-20Paper
Vertex cover in conflict graphs2019-06-25Paper
Balanced tree partition problems with virtual nodes2019-06-25Paper
https://portal.mardi4nfdi.de/entity/Q53821312019-06-21Paper
Tree size reduction with keeping distinguishability2018-12-05Paper
https://portal.mardi4nfdi.de/entity/Q31755872018-07-18Paper
Repair position selection for inconsistent data2018-02-26Paper
Approximation for vertex cover in \(\beta\)-conflict graphs2017-11-09Paper
Minimized-cost cube query on heterogeneous information networks2017-03-03Paper
Approximate joins for XML at label level2017-02-07Paper
On the Complexity of Bounded Deletion Propagation2017-02-01Paper
On the Complexity of Extracting Subtree with Keeping Distinguishability2017-02-01Paper
https://portal.mardi4nfdi.de/entity/Q29512172017-01-06Paper
https://portal.mardi4nfdi.de/entity/Q29512192017-01-06Paper
\((\alpha,\tau )\)-monitoring for event detection in wireless sensor networks2016-11-29Paper
Approximate event detection over multi-modal sensing data2016-11-29Paper
Efficient accuracy evaluation for multi-modal sensed data2016-11-29Paper
A minimized-rule based approach for improving data currency2016-10-12Paper
On the Complexity of Insertion Propagation with Functional Dependency Constraints2016-09-02Paper
Evaluating entity-description conflict on duplicated data2016-02-23Paper
Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation2016-02-05Paper
On the hardness of labeled correlation clustering problem: a parameterized complexity view2015-12-11Paper
On the complexity of sampling query feedback restricted database repair of functional dependency violations2015-12-11Paper
On the hardness of learning queries from tree structured data2015-05-11Paper
Algorithms and complexity results for labeled correlation clustering problem2015-02-16Paper
A class of multi-period semi-variance portfolio for petroleum exploration and development2014-12-22Paper
On the Parameterized Complexity of Labelled Correlation Clustering Problem2014-09-26Paper
Sampling Query Feedback Restricted Repairs of Functional Dependency Violations: Complexity and Algorithm2014-09-26Paper
TJJE: an efficient algorithm for top-\(k\) join on massive data2014-08-01Paper
An improved distributed data aggregation scheduling in wireless sensor networks2014-04-08Paper
Minimum-time aggregation scheduling in duty-cycled wireless sensor networks2014-02-11Paper
Finding multiple induced disjoint paths in general graphs2013-04-04Paper
Supporting early pruning in top-\(k\) query processing on massive data2013-03-28Paper
Data Model for Dirty Databases2013-01-24Paper
Adding regular expressions to graph reachability and pattern queries2012-11-15Paper
https://portal.mardi4nfdi.de/entity/Q30143052011-07-19Paper
Efficient algorithms for supergraph query processing on graph databases2011-03-17Paper
Mining Evolving Patterns of Connection Subgraphs over Evolving Graphs2011-02-05Paper
Efficient Aggregation Algorithms on XML Stream2010-02-12Paper
A new heuristic for task scheduling in heterogeneous computing environment2009-12-15Paper
Pseudo-potential of elastoplastic damage constitutive model and its application2009-12-09Paper
A Performance Study of Task Scheduling Heuristics in HC Environment2009-05-13Paper
https://portal.mardi4nfdi.de/entity/Q36109762009-03-06Paper
Missing Values Estimation in Microarray Data with Partial Least Squares Regression2008-12-09Paper
Improved Feistel-based ciphers for wireless sensor network security2008-09-24Paper
https://portal.mardi4nfdi.de/entity/Q35136792008-08-06Paper
Incorporating domain knowledge into medical image clustering2007-03-27Paper
https://portal.mardi4nfdi.de/entity/Q34213532007-02-12Paper
https://portal.mardi4nfdi.de/entity/Q54911802006-10-10Paper
https://portal.mardi4nfdi.de/entity/Q54911772006-10-10Paper
https://portal.mardi4nfdi.de/entity/Q54911832006-10-10Paper
https://portal.mardi4nfdi.de/entity/Q54903912006-10-04Paper
https://portal.mardi4nfdi.de/entity/Q33656752006-01-23Paper
https://portal.mardi4nfdi.de/entity/Q33656762006-01-23Paper
https://portal.mardi4nfdi.de/entity/Q57050932005-11-16Paper
https://portal.mardi4nfdi.de/entity/Q57050842005-11-16Paper
The spatio-temporal structure of binary fluid convection with horizontal flow2005-10-27Paper
https://portal.mardi4nfdi.de/entity/Q53144342005-09-05Paper
Advances in Databases and Information Systems2005-08-19Paper
https://portal.mardi4nfdi.de/entity/Q46739562005-05-09Paper
https://portal.mardi4nfdi.de/entity/Q48238592004-10-28Paper
https://portal.mardi4nfdi.de/entity/Q48238182004-10-28Paper
https://portal.mardi4nfdi.de/entity/Q44708992004-06-18Paper
https://portal.mardi4nfdi.de/entity/Q44170982003-07-28Paper
https://portal.mardi4nfdi.de/entity/Q47086222003-06-18Paper
https://portal.mardi4nfdi.de/entity/Q47100202003-01-01Paper
Fully-developed traveling wave convection in binary fluid mixtures with lateral flow2002-02-28Paper
Time complexity of multidimensional range queries in multiple storage units.2002-02-19Paper
Efficient aggregation algorithms on very large compressed data warehouses2001-10-01Paper
Numerical solutions of Reynolds-averaged Navier-Stokes equations for 3-D turbulent flow over concave surface of discharging structures2001-08-30Paper
Numerical solution for turbulent flows on concave surfaces of spillway dams2000-09-18Paper
https://portal.mardi4nfdi.de/entity/Q42537002000-09-05Paper
Numerical analysis of dynamic behavior of stream turbine blade group2000-08-21Paper
https://portal.mardi4nfdi.de/entity/Q48919391996-11-20Paper
Turbulent boundary layer development in the entrance region of a smooth round pipe1993-08-30Paper
https://portal.mardi4nfdi.de/entity/Q40381621993-05-16Paper
Batched interpolation searching on databases1989-01-01Paper

Research outcomes over time

This page was built for person: Jianzhong Li