The following pages link to Jinhui Xu (Q185439):
Displaying 50 items.
- Chromatic kernel and its applications (Q266072) (← links)
- Approximating minimum bending energy path in a simple corridor (Q390148) (← links)
- Improved algorithms for the farthest colored Voronoi diagram of segments (Q391216) (← links)
- On the central path problem (Q393050) (← links)
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions (Q401311) (← links)
- Computing the map of geometric minimal cuts (Q476438) (← links)
- Efficient approximation algorithms for clustering point-sets (Q733558) (← links)
- Efficient algorithms for determining 3D biplane imaging geometry (Q813330) (← links)
- Efficient job scheduling algorithms with multi-type contentions (Q813335) (← links)
- Graph bandwidth of weighted caterpillars (Q860873) (← links)
- Constant approximation algorithms for rectangle stabbing and related problems (Q866919) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- Almost optimal solutions for bin coloring problems (Q941831) (← links)
- An improved approximation algorithm for uncapacitated facility location problem with penalties (Q1029272) (← links)
- On lazy bin covering and packing problems (Q1041247) (← links)
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties (Q1041733) (← links)
- Robustness of \(k\)-gon Voronoi diagram construction (Q1045919) (← links)
- Computing optimal beams in two and three dimensions (Q1402534) (← links)
- Medical image segmentation using fruit fly optimization and density peaks clustering (Q1728793) (← links)
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications (Q1774529) (← links)
- Geometric permutations of higher dimensional spheres (Q1883581) (← links)
- Ensemble clustering using semidefinite programming with applications (Q1959572) (← links)
- Influence-based Voronoi diagrams of clusters (Q1984607) (← links)
- Small candidate set for translational pattern search (Q2088592) (← links)
- An efficient sum query algorithm for distance-based locally dominating functions (Q2196604) (← links)
- Robust high dimensional expectation maximization algorithm via trimmed hard thresholding (Q2217416) (← links)
- A coarse-grained reconfigurable computing architecture with loop self-pipelining (Q2267088) (← links)
- Generalized median graphs and applications (Q2271138) (← links)
- Principal component analysis in the local differential privacy model (Q2290637) (← links)
- A unified framework for clustering constrained data without locality property (Q2300724) (← links)
- Learning the truth vector in high dimensions (Q2301361) (← links)
- Tight lower bound of sparse covariance matrix estimation in the local differential privacy model (Q2310743) (← links)
- A faster algorithm for truth discovery via range cover (Q2324248) (← links)
- Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems (Q2379919) (← links)
- Faster algorithm for truth discovery via range cover (Q2405304) (← links)
- FPTAS for minimizing the earth mover's distance under rigid transformations and related problems (Q2408088) (← links)
- Novel geometric approach for virtual coiling (Q2636492) (← links)
- On the connectivity preserving minimum cut problem (Q2637652) (← links)
- Inferring ground truth from crowdsourced data under local attribute differential privacy (Q2661780) (← links)
- Differentially private high dimensional sparse covariance matrix estimation (Q2661783) (← links)
- (Q2768301) (← links)
- FPTAS for Minimizing Earth Mover’s Distance under Rigid Transformations (Q2849331) (← links)
- Map of Geometric Minimal Cuts for General Planar Embedding (Q2867123) (← links)
- On the 2-Central Path Problem (Q2914356) (← links)
- Algorithms for Cut Problems on Trees (Q2942406) (← links)
- Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere (Q3012849) (← links)
- Approximating Minimum Bending Energy Path in a Simple Corridor (Q3060745) (← links)
- Traveling Salesman Problem of Segments (Q3082911) (← links)
- Finding global optimum for truth discovery: Entropy based geometric variance (Q3132868) (← links)
- On the Central Path Problem (Q3167356) (← links)
