Zobrazeno 1 - 10
of 257
pro vyhledávání: '"Berry, Jonathan"'
We show that certain Graph Laplacian linear sets of equations exhibit optimal accuracy, guaranteeing that the relative error is no larger than the norm of the relative residual and that optimality occurs for carefully chosen right-hand sides. Such se
Externí odkaz:
http://arxiv.org/abs/2405.07877
Designing flexible graph kernels that can run well on various platforms is a crucial research problem due to the frequent usage of graphs for modeling data and recent architectural advances and variety. In this work, we propose a novel graph processi
Externí odkaz:
http://arxiv.org/abs/2209.04541
Motivated by the properties of unending real-world cybersecurity streams, we present a new graph streaming model: XStream. We maintain a streaming graph and its connected components at single-edge granularity. In cybersecurity graph applications, inp
Externí odkaz:
http://arxiv.org/abs/2112.00098
Autor:
Foss, Alexander H., Lehoucq, Richard B., Stuart, W. Zachary, Tucker, J. Derek, Berry, Jonathan W.
We introduce HITMIX, a new technique for network seed-set expansion, i.e., the problem of identifying a set of graph vertices related to a given seed-set of vertices. We use the moments of the graph's hitting-time distribution to quantify the relatio
Externí odkaz:
http://arxiv.org/abs/2011.09544
Autor:
Chrysafi, Pavlina, Barnum, Kevin, Gerhard, Genevieve M., Chiasakul, Thita, Narang, Arshit, Mcnichol, Megan, Riva, Nicoletta, Semmler, Georg, Scheiner, Bernhard, Acosta, Stefan, Rautou, Pierre-Emmanuel, Lauw, Mandy N., Berry, Jonathan, Ageno, Walter, Zwicker, Jeffrey I., Patell, Rushad
Publikováno v:
In Journal of Thrombosis and Haemostasis June 2024
Triangle counting is a fundamental building block in graph algorithms. In this paper, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the al
Externí odkaz:
http://arxiv.org/abs/2009.12457
Autor:
Berry, Jonathan, Hilts, Katy Ellis, Thoma, Lynn, Corelli, Robin L., Stump, Timothy E., Monahan, Patrick O., Hudmon, Karen Suchanek
Publikováno v:
In Research in Social and Administrative Pharmacy December 2023 19(12):1531-1542
Autor:
Chase, Matthew L., Drews, Reed, Zumberg, Marc S., Ellis, Leslie R., Reid, Erin G., Gerds, Aaron T., Lee, Alfred I., Hobbs, Gabriela S., Berry, Jonathan, Freed, Jason A.
Publikováno v:
In Blood Advances 11 July 2023 7(13):3244-3252
Autor:
Bender, Michael A., Berry, Jonathan W., Farach-Colton, Martin, Johnson, Rob, Kroeger, Thomas M., Pandey, Prashant, Phillips, Cynthia A., Singh, Shikha
Given a stream $S = (s_1, s_2, ..., s_N)$, a $\phi$-heavy hitter is an item $s_i$ that occurs at least $\phi N$ times in $S$. The problem of finding heavy-hitters has been extensively studied in the database literature. In this paper, we study a rela
Externí odkaz:
http://arxiv.org/abs/1812.09824