„Estimation Algorithms“

Suchergebnisse

817 Treffer

• Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs
  Assadi, Sepehr ; Joshi, Nirmit ; Prabhu, Milind ; Shah, Vihan 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Differentially Private Continual Releases of Streaming Frequency Moment Estimations
  Epasto, Alessandro ; Mao, Jieming ; Medina, Andres Munoz ; Mirrokni, Vahab ; Vassilvitskii, Sergei ; Zhong, Peilin 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Affirmative Sampling: Theory and Applications
  Lumbroso, Jérémie ; Martínez, Conrado 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Faster Counting and Sampling Algorithms Using Colorful Decision Oracle
  Bhattacharya, Anup ; Bishnu, Arijit ; Ghosh, Arijit ; Mishra, Gopinath 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube
  Bishnu, Arijit ; Ghosh, Arijit ; Mishra, Gopinath 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• New Sublinear Algorithms and Lower Bounds for LIS Estimation
  Newman, Ilan ; Varma, Nithin 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• How to Send a Real Number Using a Single Bit (And Some Shared Randomness)
  Ben Basat, Ran ; Mitzenmacher, Michael ; Vargaftik, Shay 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quantum Probability Oracles & Multidimensional Amplitude Estimation
  van Apeldoorn, Joran 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation
  Chen, Yu ; Kannan, Sampath ; Khanna, Sanjeev 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Usage of the dwarf mongoose optimization on estimation algorithms related to fiber-reinforced recycled aggregate concrete
  Wang, Linfang
• An alignment-free method for phylogeny estimation using maximum likelihood
  Zahin, Tasfia ; Abrar, Md. Hasin ; Jewel, Mizanur Rahman ; Tasnim, Tahrina ; Bayzid, Md. Shamsuzzoha ; Rahman, Atif
• Reachability and Shortest Paths in the Broadcast CONGEST Model
  Chechik, Shiri ; Mukhtar, Doron 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fast and Accurate Structure Probability Estimation for Simultaneous Alignment and Folding of RNAs
  Miladi, Milad ; Raden, Martin ; Will, Sebastian ; Backofen, Rolf 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Preserving Randomness for Adaptive Algorithms
  Hoza, William M. ; Klivans, Adam R. 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Comparative analysis of recursive and nonrecursive linearization-based estimation algorithms
  Isaev, Alexey ; Stepanov, Oleg ; Litvinenko, Yulia
• Lower Bounds on Black-Box Reductions of Hitting to Density Estimation
  Tell, Roei 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs
  Cormode, Graham ; Jowhari, Hossein ; Monemizadeh, Morteza ; Muthukrishnan, S. 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection
  Eden, Talya ; Ron, Dana ; Seshadhri, C. 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Penalized empirical likelihood estimation and EM algorithms for closed-population capture–recapture models
  Liu, Yang ; Li, Pengfei ; Liu, Yukun
• Tisslet tissues-based learning estimation for transcriptomics
  Miloudi, Ahmed ; Al-Qahtani, Aisha ; Hashir, Thamanna ; Chikri, Mohamed ; Bensmail, Halima