„branch-depth“

Suchergebnisse

1.000+ Treffer

• Effects of root diameter, branch order, root depth, season and warming on root longevity in an alpine meadow
  Wang, Zhikai ; Ding, Lubin ; Wang, Jingsheng ; Zuo, Xiaolong ; Yao, Shuaichen ; Feng, Jiguang
• Pseudorandom Generators for Read-Once Monotone Branching Programs
  Doron, Dean ; Meka, Raghu ; Reingold, Omer ; Tal, Avishay ; Vadhan, Salil 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming
  Chen, Li-Hsuan ; Reidl, Felix ; Rossmanith, Peter ; Sanchez Villaamil, Fernando 2018 Universitätsbibliothek der RWTH Aachen
• Effects of root diameter, branch order, soil depth and season of birth on fine root life span in five temperate tree species
  Gu, Jiacun ; Wang, Yan ; Fahey, Timothy J. ; Wang, Zhengquan
• Stochastic Tree Models for Macroevolution – Development, Validation and Application
  Keller-Schmidt, Stephanie ; Stadler, Peter F. ; Klemm, Konstantin ; Kaski, Kimmo 2012 Universitätsbibliothek Leipzig
• On the depth of the Branch and Bound tree for solving the Maximum Stable Set Problem
  Baniasadirad, Fatemeh ; Jarre, Florian ; Schädle, Achim 2018 Universitäts- und Landesbibliothek der Heinrich-Heine-Universität Düsseldorf
• Erratum to: The Centre and the Depth of the Centre for Continuous Maps on Dendrites with Finite Branch Points
  Sun, Taixiang ; Xi, Hongjian
• Multi-focus image fusion based on double branch encoder and depth information learning
  Jin, Xin ; Shao, Xinfeng ; Wang, Shiwei ; Pan, Chengyi ; Yao, Shaowen ; Jiang, Qian
• A monocular endoscopic image depth estimation method based on a window-adaptive asymmetric dual-branch Siamese network
  Chong, Nannan ; Yang, Fan ; Wei, Kewei
• Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming
  Chan, Timothy F. N. ; Cooper, Jacob W. ; Koutecký, Martin ; Král', Daniel ; Pekárková, Kristýna 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs
  Buss, Sam ; Das, Anupam ; Knop, Alexander 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Circuit Lower Bounds for MCSP from Local Pseudorandom Generators
  Cheraghchi, Mahdi ; Kabanets, Valentine ; Lu, Zhenjian ; Myrisiotis, Dimitrios 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits
  Kayal, Neeraj ; Nair, Vineet ; Saha, Chandan 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Two Sides of the Coin Problem
  Cohen, Gil ; Ganor, Anat ; Raz, Ran 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A quantitative in-depth analysis of the prototype sdB plus BD system SDSS J08205+0008 revisited in the Gaia era
  Schaffenroth, Veronika ; Casewell, Sarah L. ; Schneider, D. ; Kilkenny, David ; Geier, Stephan ; Heber, Ulrich ; Irrgang, Andreas ; Przybilla, Norbert ; Marsh, Thomas R. ; Littlefair, Stuart P. ; Dhillon, Vik S. 2020 Universität Potsdam
• Depth-based branching level estimation for bronchoscopic navigation
  Wang, Cheng ; Hayashi, Yuichiro ; Oda, Masahiro ; Kitasaka, Takayuki ; Takabatake, Hirotsugu ; Mori, Masaki ; Honma, Hirotoshi ; Natori, Hiroshi ; Mori, Kensaku
• On circuits of functional elements of finite depth of branching
  Cherukhin, D. Yu.
• Branching of the Tsushima Current by an Abrupt Increase of Bottom Depth
  Seung, Young Ho
• CA-DBMNet: a channel attention based dual branch multi-scale network for depth map super-resolution
  Miao, Yongwei ; Zhang, Xinjie ; Sun, Yuliang ; Wang, Jinrong
• Depth-m search in branch-and-bound algorithms
  Ibaraki, Toshihide