Zobrazeno 1 - 10
of 1 986
pro vyhledávání: '"Krueger, Robert A."'
Let $\mathrm{ex}(n,H,\mathcal{F})$ be the maximum number of copies of $H$ in an $n$-vertex graph which contains no copy of a graph from $\mathcal{F}$. Thinking of $H$ and $\mathcal{F}$ as fixed, we study the asymptotics of $\mathrm{ex}(n,H,\mathcal{F
Externí odkaz:
http://arxiv.org/abs/2409.08424
Given a connected finite graph $G$, an integer-valued function $f$ on $V(G)$ is called $M$-Lipschitz if the value of $f$ changes by at most $M$ along the edges of $G$. In 2013, Peled, Samotij, and Yehudayoff showed that random $M$-Lipschitz functions
Externí odkaz:
http://arxiv.org/abs/2408.14702
Autor:
Herzberger, Lukas, Hadwiger, Markus, Krüger, Robert, Sorger, Peter, Pfister, Hanspeter, Gröller, Eduard, Beyer, Johanna
We present a hybrid multi-volume rendering approach based on a novel Residency Octree that combines the advantages of out-of-core volume rendering using page tables with those of standard octrees. Octree approaches work by performing hierarchical tre
Externí odkaz:
http://arxiv.org/abs/2309.04393
Autor:
Araujo, Igor, Frederickson, Bryce, Krueger, Robert A., Lidický, Bernard, McAllister, Tyrrell B., Pfender, Florian, Spiro, Sam, Stucky, Eric Nathan
We consider a geometric percolation process partially motivated by recent work of Hejda and Kala. Specifically, we start with an initial set $X \subseteq \mathbb{Z}^2$, and then iteratively check whether there exists a triangle $T \subseteq \mathbb{R
Externí odkaz:
http://arxiv.org/abs/2303.15402
Autor:
Araujo, Igor, Black, Alexander E., Burcroff, Amanda, Gao, Yibo, Krueger, Robert A., McDonough, Alex
Given two vectors $u$ and $v$, their outer sum is given by the matrix $A$ with entries $A_{ij} = u_{i} + v_{j}$. If the entries of $u$ and $v$ are increasing and sufficiently generic, the total ordering of the entries of the matrix is a standard Youn
Externí odkaz:
http://arxiv.org/abs/2302.09194
In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. For digraphs, they showed that for every $\alpha>0$, there exists a constant $C$ such that for every $n$-vertex digraph of minimum semi-degree at least
Externí odkaz:
http://arxiv.org/abs/2212.10112
Autor:
Balogh, József, Krueger, Robert A.
The Boolean lattice $\mathcal{P}(n)$ consists of all subsets of $[n] = \{1,\dots, n\}$ partially ordered under the containment relation. Sperner's Theorem states that the largest antichain of the Boolean lattice is given by a middle layer: the collec
Externí odkaz:
http://arxiv.org/abs/2205.11630
Autor:
Yang, Yalong, Xia, Wenyu, Lekschas, Fritz, Nobre, Carolina, Krueger, Robert, Pfister, Hanspeter
Matrix visualizations are widely used to display large-scale network, tabular, set, or sequential data. They typically only encode a single value per cell, e.g., through color. However, this can greatly limit the visualizations' utility when explorin
Externí odkaz:
http://arxiv.org/abs/2203.05109
Autor:
Haywood, Darren, Kotov, Roman, Krueger, Robert F., Wright, Aidan G.C., Forbes, Miriam K., Dauer, Evan, Baughman, Frank D., Rossell, Susan L., Hart, Nicolas H.
Publikováno v:
In Trends in Cancer August 2024 10(8):677-686
Publikováno v:
In Social Science & Medicine July 2024 352