Zobrazeno 1 - 10
of 1 128
pro vyhledávání: '"Mount, David"'
Autor:
Acharya, Aditya, Mount, David M.
Geometric data sets arising in modern applications are often very large and change dynamically over time. A popular framework for dealing with such data sets is the evolving data framework, where a discrete structure continuously varies over time due
Externí odkaz:
http://arxiv.org/abs/2409.11779
Autor:
Parepally, Nithin, Chatterjee, Ainesh, Gezalyan, Auguste, Du, Hongyang, Mangla, Sukrit, Wu, Kenny, Hwang, Sarah, Mount, David
There are many structures, both classical and modern, involving convex polygonal geometries whose deeper understanding would be facilitated through interactive visualizations. The Ipe extensible drawing editor, developed by Otfried Cheong, is a widel
Externí odkaz:
http://arxiv.org/abs/2403.10033
Autor:
Gezalyan, Auguste, Kim, Soo, Lopez, Carlos, Skora, Daniel, Stefankovic, Zofia, Mount, David M.
The Hilbert metric is a distance function defined for points lying within the interior of a convex body. It arises in the analysis and processing of convex bodies, machine learning, and quantum information theory. In this paper, we show how to adapt
Externí odkaz:
http://arxiv.org/abs/2312.05987
Autor:
Centuori, Sara M., Gomes, Cecil J., Kim, Samuel S., Putnam, Charles W., Larsen, Brandon T., Garland, Linda L., Mount, David W., Martinez, Jesse D.
Background: The presence of B cells in early stage non-small cell lung cancer (NSCLC) is associated with longer survival, however, the role these cells play in the generation and maintenance of anti-tumor immunity is unclear. B cells differentiate in
Externí odkaz:
http://hdl.handle.net/10150/627195
http://arizona.openrepository.com/arizona/handle/10150/627195
http://arizona.openrepository.com/arizona/handle/10150/627195
Autor:
Abdelkader, Ahmed, Mount, David M.
Traditional problems in computational geometry involve aspects that are both discrete and continuous. One such example is nearest-neighbor searching, where the input is discrete, but the result depends on distances, which vary continuously. In many r
Externí odkaz:
http://arxiv.org/abs/2308.08791
Approximating convex bodies is a fundamental question in geometry and has a wide variety of applications. Given a convex body $K$ of diameter $\Delta$ in $\mathbb{R}^d$ for fixed $d$, the objective is to minimize the number of vertices (alternatively
Externí odkaz:
http://arxiv.org/abs/2306.15648
We present a new approach to approximate nearest-neighbor queries in fixed dimension under a variety of non-Euclidean distances. We are given a set $S$ of $n$ points in $\mathbb{R}^d$, an approximation parameter $\varepsilon > 0$, and a distance func
Externí odkaz:
http://arxiv.org/abs/2306.15621
Autor:
Acharya, Aditya, Mount, David
The evolving data framework was first proposed by Anagnostopoulos et al., where an evolver makes small changes to a structure behind the scenes. Instead of taking a single input and producing a single output, an algorithm judiciously probes the curre
Externí odkaz:
http://arxiv.org/abs/2306.03306
Autor:
Bumpus, Madeline, Dai, Xufeng Caesar, Gezalyan, Auguste H., Munoz, Sam, Santhoshkumar, Renita, Ye, Songyu, Mount, David M.
The Hilbert metric is a projective metric defined on a convex body which generalizes the Cayley-Klein model of hyperbolic geometry to any convex set. In this paper we analyze Hilbert Voronoi diagrams in the Dynamic setting. In addition we introduce d
Externí odkaz:
http://arxiv.org/abs/2304.02745
Autor:
Arya, Sunil, Mount, David M.
Approximating convex bodies is a fundamental question in geometry and has a wide variety of applications. Consider a convex body $K$ of diameter $\Delta$ in $\textbf{R}^d$ for fixed $d$. The objective is to minimize the number of vertices (alternativ
Externí odkaz:
http://arxiv.org/abs/2303.09586