The following pages link to Jian-Zhong Li (Q946655):
Displaying 50 items.
- (Q189999) (redirect page) (← links)
- A minimized-rule based approach for improving data currency (Q326482) (← links)
- \((\alpha,\tau )\)-monitoring for event detection in wireless sensor networks (Q346476) (← links)
- Approximate event detection over multi-modal sensing data (Q346477) (← links)
- Efficient accuracy evaluation for multi-modal sensed data (Q346487) (← links)
- Approximate joins for XML at label level (Q507755) (← links)
- Minimized-cost cube query on heterogeneous information networks (Q512896) (← links)
- Efficient algorithms for supergraph query processing on graph databases (Q630186) (← links)
- Incorporating domain knowledge into medical image clustering (Q872322) (← links)
- On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155) (← links)
- On the complexity of sampling query feedback restricted database repair of functional dependency violations (Q896157) (← links)
- Improved Feistel-based ciphers for wireless sensor network security (Q946657) (← links)
- Pseudo-potential of elastoplastic damage constitutive model and its application (Q1043441) (← links)
- A new heuristic for task scheduling in heterogeneous computing environment (Q1045539) (← links)
- Turbulent boundary layer development in the entrance region of a smooth round pipe (Q1210191) (← links)
- Numerical analysis of dynamic behavior of stream turbine blade group (Q1575470) (← links)
- Tree size reduction with keeping distinguishability (Q1630987) (← links)
- Approximation for vertex cover in \(\beta\)-conflict graphs (Q1679502) (← links)
- Repair position selection for inconsistent data (Q1699811) (← links)
- Adding regular expressions to graph reachability and pattern queries (Q1762201) (← links)
- Batched interpolation searching on databases (Q1824401) (← links)
- Finding multiple induced disjoint paths in general graphs (Q1944193) (← links)
- Supporting early pruning in top-\(k\) query processing on massive data (Q1944943) (← links)
- Numerical solution for turbulent flows on concave surfaces of spillway dams (Q1976316) (← links)
- Functional dependency restricted insertion propagation (Q1986557) (← links)
- Learned sketches for frequency estimation (Q1999028) (← links)
- How hard is completeness reasoning for conjunctive queries? (Q2019449) (← links)
- Range partitioning within sublinear time in the external memory model (Q2039680) (← links)
- New results on the complexity of deletion propagation (Q2039681) (← links)
- On the complexity and approximability of repair position selection problem (Q2051902) (← links)
- Data source selection for approximate query (Q2084622) (← links)
- Efficient top-\(k\) high utility itemset mining on massive data (Q2127081) (← links)
- A true \(O(n\log{n})\) algorithm for the all-\(k\)-nearest-neighbors problem (Q2180169) (← links)
- Parallel algorithms for flexible pattern matching on big graphs (Q2195447) (← links)
- Maximum reachability preserved graph cut (Q2202008) (← links)
- The parameterized complexity and kernelization of resilience for database queries (Q2202009) (← links)
- Vaginal secretions epithelial cells and bacteria recognition based on computer vision (Q2217045) (← links)
- Range partitioning within sublinear time: algorithms and lower bounds (Q2220789) (← links)
- Algorithms and complexity results for labeled correlation clustering problem (Q2253964) (← links)
- An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN (Q2283022) (← links)
- An algorithm for reducing approximate nearest neighbor to approximate near neighbor with \(O(\log{n})\) query time (Q2327126) (← links)
- On the hardness of learning queries from tree structured data (Q2343989) (← links)
- Balanced tree partition problems with virtual nodes (Q2424724) (← links)
- Vertex cover in conflict graphs (Q2424881) (← links)
- An improved distributed data aggregation scheduling in wireless sensor networks (Q2444150) (← links)
- TJJE: an efficient algorithm for top-\(k\) join on massive data (Q2510479) (← links)
- The spatio-temporal structure of binary fluid convection with horizontal flow (Q2569516) (← links)
- Minimum-time aggregation scheduling in duty-cycled wireless sensor networks (Q2637250) (← links)
- Existence of traveling waves for a nonlocal dispersal SIR epidemic model with treatment (Q2661179) (← links)
- Parameterized complexity of completeness reasoning for conjunctive queries (Q2661762) (← links)
