87 results on '"H C, Jiang"'
Search Results
2. Algorithms for the Generalized Poset Sorting Problem.
3. Moderate Dimension Reduction for k-Center Clustering.
4. Fully Dynamic Algorithms for Euclidean Steiner Tree.
5. Dynamic Facility Location in High Dimensional Euclidean Spaces.
6. Streaming Euclidean Max-Cut: Dimension vs Data Reduction.
7. Near-Optimal Quantum Coreset Construction Algorithms for Clustering.
8. The Power of Uniform Sampling for k-Median.
9. Enhanced charge density wave with mobile superconducting vortices in La1.885Sr0.115CuO4
10. Streaming Algorithms for Geometric Steiner Forest.
11. The Power of Uniform Sampling for Coresets.
12. Streaming Facility Location in High Dimension via Geometric Hashing.
13. Online File Caching in Latency-Sensitive Systems with Delayed Hits and Bypassing.
14. On The Relative Error of Random Fourier Features for Preserving Kernel Distance.
15. Near-optimal Coresets for Robust Clustering.
16. Coresets for Clustering with Missing Values.
17. Coresets for Clustering in Excluded-minor Graphs and Beyond.
18. Scheduling Placement-Sensitive BSP Jobs with Inaccurate Execution Time Estimation.
19. Online dispatching and scheduling of jobs with heterogeneous utilities in edge computing.
20. Coresets for Clustering in Graphs of Bounded Treewidth.
21. Online Facility Location with Predictions.
22. Coresets for Clustering with Fairness Constraints.
23. Dependent task placement and scheduling with function configuration in edge computing.
24. Camul: Online Caching on Multiple Caches with Relaying and Bypassing.
25. Coresets for Ordered Weighted Clustering.
26. Epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics.
27. A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics.
28. Online Submodular Maximization Problem with Vector Packing Constraint.
29. Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids.
30. Online Approximation Scheme for Scheduling Heterogeneous Utility Jobs in Edge Computing
31. Variation of nanoparticle fraction and compositions in two-stage double peaks aging precipitation of Al−Zn−Mg alloy
32. A PTAS for the Steiner Forest Problem in Doubling Metrics.
33. Efficient online coflow routing and scheduling.
34. Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics.
35. Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order.
36. TorusVisND: unraveling high-dimensional torus networks for network traffic visualizations.
37. SPIN: BSP Job Scheduling With Placement-Sensitive Execution
38. Effect of resistance exercise on peripheral inflammatory biomarkers in healthy adults: a meta-analysis of randomized controlled trials
39. Asymptotically Optimal Online Caching on Multiple Caches With Relaying and Bypassing
40. The hydrothermally synthesis of K 3 AlF 6 :Cr 3+ NIR phosphor and its performance optimization based on phase control
41. Effects of aerobic exercise on inflammatory factors in healthy adults: a meta-analysis
42. CaAlSiN3:Eu2+/Lu3Al5O12:Ce3+ phosphor-in-glass film with high luminous efficiency and CRI for laser diode lighting
43. A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics
44. [Analysis of influencing factors on surgical outcome and exploration of technical principles during pancreaticojejunostomy]
45. OnDisc: Online Latency-Sensitive Job Dispatching and Scheduling in Heterogeneous Edge-Clouds
46. Joint Online Coflow Routing and Scheduling in Data Center Networks
47. [What else should surgeons do when ERAS is in-depth development]
48. [A comparative study of breast cancer mass screening and opportunistic screening in Chinese women]
49. [Four-steps surgery for infected pancreatic necrosis based on 'Step-up' strategy: a retrospective study]
50. [Non-technical skills for surgeons]
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.