„Randomized Decision Tree“

Suchergebnisse

1.000+ Treffer

• ˜Aœ lower bound for randomized algebraic decision trees
  Grigoriev, Dima ; Meyer auf der Heide, Friedhelm 1996 Basel [u.a.] : Birkhäuser
• A lower bound for randomized algebraic decision trees
  Grigoriev, Dima 1995 Inst. für Informatik
• Economic evaluation of financial incentives for maternal and child health in the Democratic Republic of the Congo (DRC): a decision-tree modelling based on a cluster randomized controlled trial
  Zeng, Wu ; Shapira, Gil ; Gao, Tianjiao ; Muvudi, Michel ; Li, Guohong ; Bouey, Jennifer ; Antwisi, Delphin ; Yamani, Fatma El Kadiri El
• Lifting to Randomized Parity Decision Trees
  Byramji, Farzan ; Impagliazzo, Russell 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computer Games – Third Workshop on Computer Games, CGW 2014, Held in Conjunction with the 21st European Conference on Artificial Intelligence, ECAI 2014, Prague, Czech Republic, August 18, 2014, Revised Selected Papers
  2014 Springer International Publishing
• Decision Forests for Computer Vision and Medical Image Analysis
  Criminisi, A. ; Shotton, J. 2013 Springer London
• Using machine learning to predict paperboard properties – a case study
  Othen, Rosario ; Cloppenburg, Frederik ; Gries, Thomas
• Randomized Query Composition and Product Distributions
  Sanyal, Swagato 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Randomized Lifting to Semi-Structured Communication Complexity via Linear Diversity
  Podolskii, Vladimir ; Shekhovtsov, Alexander 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Lower Bound on the Trace Norm of Boolean Matrices and Its Applications
  Cheung, Tsun-Ming ; Hatami, Hamed ; Hosseini, Kaave ; Nikolov, Aleksandar ; Pitassi, Toniann ; Shirley, Morgan 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture
  Chattopadhyay, Arkadev ; Garg, Ankit ; Sherif, Suhail 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Optimal Separation and Strong Direct Sum for Randomized Query Complexity
  Blais, Eric ; Brody, Joshua 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates
  Bajpai, Swapnam ; Krishan, Vaibhav ; Kush, Deepanshu ; Limaye, Nutan ; Srinivasan, Srikanth 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Composition Theorem for Randomized Query Complexity
  Anshu, Anurag ; Gavinsky, Dmitry ; Jain, Rahul ; Kundu, Srijita ; Lee, Troy ; Mukhopadhyay, Priyanka ; Santha, Miklos ; Sanyal, Swagato 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Zero-Error Randomized Query Complexity of the Pointer Function
  Radhakrishnan, Jaikumar ; Sanyal, Swagato 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Randomized Query Complexity of Sabotaged and Composed Functions
  Shalev, Ben-David ; Kothari, Robin 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Towards Better Separation between Deterministic and Randomized Query Complexity
  Mukhopadhyay, Sagnik ; Sanyal, Swagato 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Separating Decision Tree Complexity from Subcube Partition Complexity
  Kothari, Robin ; Racicot-Desloges, David ; Santha, Miklos 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Lower bound for randomized linear decision trees recognising a union of hyperplanes ina gerneric position
  Grigoriev, Dima ; Karpiński, Marek 1994 Inst. für Informatik
• Randomized decision tree complexity of Deutsch–Jozsa problem and a generalization
  Xu, Guoliang ; Qiu, Daowen ; Zhang, Binbin ; Wang, Tianyin ; Zhang, Yongxin