Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Todd Heywood"'
Autor:
Sam O. Kleeman, Breanna Demestichas, Nicholas Mourikis, Dominik Loiero, Miriam Ferrer, Sean Bankier, Yosef J.R.A. Riazat-Kesh, Hassal Lee, Dimitrios Chantzichristos, Claire Regan, Jonathan Preall, Sarthak Sinha, Nicole Rosin, Bryan Yipp, Luiz G.N. de Almeida, Jeff Biernaskie, Antoine Dufour, Pinkus Tober-Lau, Arno Ruusalepp, Johan L. M. Bjorkegren, Markus Ralser, Florian Kurth, Vadim Demechev, Todd Heywood, Qing Gao, Gudmundur Johannsson, Viktor H. Koelzer, Brian R. Walker, Hannah V. Meyer, Tobias Janowitz
The secreted protein Cystatin C (CyC) is a cysteine protease inhibitor of incompletely characterized biomedical function, used clinically for estimation of glomerular filtration rate. Plasma CyC is elevated in many patients, especially when they rece
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b15f807a2bceeb5faa7785099921576
https://doi.org/10.1101/2021.08.17.21261668
https://doi.org/10.1101/2021.08.17.21261668
Autor:
Todd, Heywood
Publikováno v:
Positively aware : the monthly journal of the Test Positive Aware Network. 26(6)
Autor:
Sanjay Ranka, Todd Heywood
Publikováno v:
Journal of Parallel and Distributed Computing. 16:233-249
A companion paper has introduced the Hierarchical PRAM (H-PRAM) model of parallel computation, which achieves a good balance between simplicity of usage and the reflectivity of realistic parallel computers. In this paper, we demonstrate the usage of
Autor:
Sanjay Ranka, Todd Heywood
Publikováno v:
Journal of Parallel and Distributed Computing. 16:212-232
We introduce a model of parallel computation that retains the ideal properties of the PRAM by using it as a submodel, while simultaneously being more reflective of realistic parallel architectures by accounting for and providing abstract control over
Autor:
Sanjay Ranka, Todd Heywood
Publikováno v:
Pattern Recognition. 24:31-40
We give an algorithm which finds all occurrences of an m1 × m2 pattern array embedded as subarrays in an n1 × n2 array of text, where at most k mismatches are allowed per occurrence. The algorithm runs in time O((k + a)(b log b + n1n2)), where a =
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.