„fast algorithm“

Suchergebnisse

2.168 Treffer

• FastTagger: an efficient algorithm for genome-wide tag SNP selection using multi-marker linkage disequilibrium
  Liu, Guimei ; Wang, Yue ; Wong, Limsoon
• Genomic selection and complex trait prediction using a fast EM algorithm applied to genome-wide markers
  Shepherd, Ross K. ; Meuwissen, Theo HE ; Woolliams, John A.
• Fast algorithm for population‐based protein structural model analysis
  Zhang, Jingfen ; Xu, Dong
• Approximate inverse preconditioning for the fast multipole BEM in acoustics
  Fischer, Matthias ; Perfahl, Holger ; Gaul, Lothar
• Fast and accurate average genome size and 16S rRNA gene average copy number computation in metagenomic data
  Pereira-Flores, Emiliano ; Glöckner, Frank Oliver ; Fernandez-Guerra, Antonio
• Fast Determination of Phenanthrene in Soil by Gas Chromatography‐Mass Spectrometry Using Chemometric Resolution and Standard Addition Method
  Yu, Weiwei ; Cai, Wensheng ; Shao, Xueguang
• A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
  Rockel, Benjamin Marc 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• CASIA-A Gait: Human Identification Through Gait Analysis With FAST and Harris Corner Detector Algorithms
  Hamid, Junainah Abd ; Raja Praveen, K. N. ; Kaur, Amandeep ; Chohan, Mandeep Kaur ; Dasi, Shivakrishna ; Kumar, P. P. N. G. Phani ; Singh, Devendra ; Alkhayyat, Ahmed
• An Improved Digital FIR Filter Design Using Fast FIR Algorithm and Modified Carry Save Addition
  Mahalakshmi, R. ; Sasilatha, T.
• Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication
  Bentert, Matthias ; Heeger, Klaus ; Koana, Tomohiro 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Packing Cycles Faster Than Erdos-Posa
  Lokshtanov, Daniel ; Mouawad, Amer E. ; Saurabh, Saket ; Zehavi, Meirav 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Schnelle Algorithmen für die Zustands- und Parameterschätzung auf bewegten Horizonten (Fast Algorithms for State and Parameter Estimation on Moving Horizons)
  Diehl, Moritz ; Kühl, Peter ; Bock, Hans Georg ; Schlöder, Johannes P.
• Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n
  Bliznets, Ivan ; Fomin, Fedor V. ; Pilipczuk, Michał ; Villanger, Yngve
• A fast algorithm for estimating large-scale permeabilities of correlated anisotropic media
  Hinrichsen, Einar L. ; Aharony, Ammon ; Feder, Jens ; Hansen, Alex ; Jøssang, Torstein ; Hardy, H. H.
• Fast Gaussian Elimination for Low Treewidth Matrices
  Fürer, Martin ; Hoppen, Carlos ; Trevisan, Vilmar 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Nussbaumer, H. J., Fast Fourier Transform and Convolution Algorithms. Springer Series in Information Sciences 2. Berlin‐Heidelberg‐New York, Springer‐Verlag‐1981, X, 248 S., 34 Abb., DM 69,–. US $ 40.80. ISBN 3‐540‐10159‐4
  Berg, L.
• CTIDH: faster constant-time CSIDH
  Banegas, Gustavo ; Bernstein, Daniel J. ; Campos, Fabio ; Chou, Tung ; Lange, Tanja ; Meyer, Michael ; Smith, Benjamin ; Sotáková, Jana
• BFL: a node and edge betweenness based fast layout algorithm for large scale networks
  Hashimoto, Tatsunori B. ; Nagasaki, Masao ; Kojima, Kaname ; Miyano, Satoru
• Fast Detour Computation for Ride Sharing
  Geisberger, Robert ; Luxen, Dennis ; Neubauer, Sabine ; Sanders, Peter ; Volker, Lars 2010 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Faster Exponential Algorithms for Cut Problems via Geometric Data Structures
  Kozma, László ; Tan, Junqi 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik