- 2024
- Zuwen Luo, Kexiang Xu:
Computing the Number and Average Size of Connected Sets in Planar 3-Trees. Graphs Comb. 40(3): 55 (2024) - Stéphane Bessy, Stéphan Thomassé, Laurent Viennot:
Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. STACS 2024: 13:1-13:12 - Svyatoslav Gryaznov, Sergei Ovcharov, Artur Riazanov:
Resolution Over Linear Equations: Combinatorial Games for Tree-like Size and Space. CoRR abs/2404.08370 (2024) - 2023
- Yao Wu, Donghua Zhu, Xuefeng Wang:
Tree enhanced deep adaptive network for cancer prediction with high dimension low sample size microarray data. Appl. Soft Comput. 136: 110078 (2023) - Jordi Gené-Mola, Mar Ferrer-Ferrer, Eduard Gregorio-Lopez, Pieter M. Blok, Jochen Hemming, Josep Ramon Morros, Joan Ramón Rosell-Polo, Verónica Vilaplana, Javier Ruiz Hidalgo:
Looking behind occlusions: A study on amodal segmentation for robust on-tree apple fruit size estimation. Comput. Electron. Agric. 209: 107854 (2023) - Svetlana Kulagina, Henning Meyerhenke, Anne Benoit:
Mapping tree-shaped workflows on systems with different memory sizes and processor speeds. Concurr. Comput. Pract. Exp. 35(25) (2023) - Zhenbang Hao, Lili Lin, Christopher J. Post, Elena A. Mikhailova, Kunyong Yu, Huirong Fang, Jian Liu:
The co-effect of image resolution and crown size on deep learning for individual tree detection and delineation. Int. J. Digit. Earth 16(1): 3753-3771 (2023) - Alexey V. Gulyaev, Mikhail V. Tamm:
Path Counting on Tree-like Graphs with a Single Entropic Trap: Critical Behavior and Finite Size Effects. Entropy 25(9): 1318 (2023) - Santanu S. Dey, Yatharth Dubey, Marco Molinaro:
Lower bounds on the size of general branch-and-bound trees. Math. Program. 198(1): 539-559 (2023) - Xujun Ye, Marin Kitaya, Shiori Abe, Fanxing Sheng, Shuhuai Zhang:
A New Small-Size Camera with Built-In Specific-Wavelength LED Lighting for Evaluating Chlorophyll Status of Fruit Trees. Sensors 23(10): 4636 (2023) - Konstantinos Panagiotou, Leon Ramzews, Benedikt Stufler:
Exact-Size Sampling of Enriched Trees in Linear Time. SIAM J. Comput. 52(5): 1097-1131 (2023) - Michael Fuchs, Tsan-Cheng Yu:
Asymptotic normality for the size of graph tries built from M-ary tree labelings. Theor. Comput. Sci. 968: 114011 (2023) - Chang Han, Jaemin Jo, Anyi Li, Bongshin Lee, Oliver Deussen, Yunhai Wang:
SizePairs: Achieving Stable and Balanced Temporal Treemaps using Hierarchical Size-based Pairing. IEEE Trans. Vis. Comput. Graph. 29(1): 193-202 (2023) - Andrew Fregly, Joseph Harvey, Burton S. Kaliski Jr., Swapneel Sheth:
Merkle Tree Ladder Mode: Reducing the Size Impact of NIST PQC Signature Algorithms in Practice. CT-RSA 2023: 415-441 - Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk:
5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size. ESA 2023: 66:1-66:16 - Aphilak Lonklang, János Botzheim:
A Rapidly-Exploring Random Tree Algorithm with Reduced Random Map Size. ICARA 2023: 356-361 - Size Zheng, Siyuan Chen, Siyuan Gao, Liancheng Jia, Guangyu Sun, Runsheng Wang, Yun Liang:
TileFlow: A Framework for Modeling Fusion Dataflow via Tree-based Analysis. MICRO 2023: 1271-1288 - Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal:
Randomized versus Deterministic Decision Tree Size. STOC 2023: 867-880 - Tomoki Anzai, Moju Zhao, Fan Shi, Kei Okada, Masayuki Inaba:
Sensing and Navigation of Aerial Robot for Measuring Tree Location and Size in Forest Environment. CoRR abs/2302.05858 (2023) - Edossa Merga Terefe:
Tree-Based Machine Learning Methods For Vehicle Insurance Claims Size Prediction. CoRR abs/2302.10612 (2023) - Stéphane Bessy, Stéphan Thomassé, Laurent Viennot:
Temporalizing digraphs via linear-size balanced bi-trees. CoRR abs/2304.03567 (2023) - Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk:
5-Approximation for $\mathcal{H}$-Treewidth Essentially as Fast as $\mathcal{H}$-Deletion Parameterized by Solution Size. CoRR abs/2306.17065 (2023) - Charles Peyrat, Paul Gallot, Sebastian Maneth, Keisuke Nakano:
Deciding Linear Height and Linear Size-to-Height Increase for Macro Tree Transducers. CoRR abs/2307.16500 (2023) - Liding Zhang, Zhenshan Bing, Kejia Chen, Lingyun Chen, Fan Wu, Peter Krumbholz, Zhilin Yuan, Sami Haddadin, Alois Knoll:
Flexible Informed Trees (FIT*): Adaptive Batch-Size Approach for Informed Sampling-Based Planner. CoRR abs/2310.12828 (2023) - 2022
- Murat Karakoyun, Ahmet Özkis:
A binary tree seed algorithm with selection-based local search mechanism for huge-sized optimization problems. Appl. Soft Comput. 129: 109590 (2022) - Shengyuan Feng, Junqing Gong, Jie Chen:
Binary Tree Encryption with Constant-Size Public Key in the Standard Model. Comput. J. 65(6): 1489-1511 (2022) - Gregor Hendel, Daniel Anderson, Pierre Le Bodic, Marc E. Pfetsch:
Estimating the Size of Branch-and-Bound Trees. INFORMS J. Comput. 34(2): 934-952 (2022) - Santanu S. Dey, Prachi Shah:
Lower bound on size of branch-and-bound trees for solving lot-sizing problem. Oper. Res. Lett. 50(5): 430-433 (2022) - JangHo Bae, Sumin Park, Mark Yim, TaeWon Seo:
Polygon-Based Random Tree Search Algorithm for a Size-Changing Robot. IEEE Robotics Autom. Lett. 7(3): 8100-8105 (2022) - Gabriel Berzunza, Cecilia Holmgren:
The asymptotic distribution of cluster sizes for supercritical percolation on random split trees. Random Struct. Algorithms 60(4): 631-652 (2022)