( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A comparative study of several Taylor expansion methods on error propagation.

, и . Geoinformatics, стр. 1-5. IEEE, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Xue-Jie Zhang

Xue Xue Zhang

Zhou Jie

Yucheng Jie

Cheng Xue

 

Другие публикации лиц с тем же именем

The Research on the Application Strategies of Information and Communication Technologies to Promote the Knowledge Transfer in Regional Innovation System., и . APSCC, стр. 138-145. IEEE Computer Society, (2006)Sparsity-Based Spatiotemporal Fusion via Adaptive Multi-Band Constraints., , , , и . Remote. Sens., 10 (10): 1646 (2018)Lattice Based Communication P Systems., , и . J. Adv. Comput. Intell. Intell. Informatics, 27 (6): 1130-1136 (ноября 2023)Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs., , , , и . SODA, стр. 2063-2084. SIAM, (2022)Fair Covering of Points by Balls., , , и . CCCG, стр. 26-32. (2020)Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3., , , , и . APPROX/RANDOM, том 317 из LIPIcs, стр. 6:1-6:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Scalable computational geometry in MapReduce., , , , , и . VLDB J., 28 (4): 523-548 (2019)True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs., , , , и . SoCG, том 224 из LIPIcs, стр. 11:1-11:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Sparse Outerstring Graphs Have Logarithmic Treewidth., , и . ESA, том 308 из LIPIcs, стр. 10:1-10:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space., , и . IJCAI, стр. 475-481. ijcai.org, (2022)