Zobrazeno 1 - 10
of 245
pro vyhledávání: '"Thomas, Rekha"'
Given a finite, simple, connected graph $G=(V,E)$ with $|V|=n$, we consider the associated graph Laplacian matrix $L = D - A$ with eigenvalues $0 = \lambda_1 < \lambda_2 \leq \dots \leq \lambda_n$. One can also consider the same graph equipped with p
Externí odkaz:
http://arxiv.org/abs/2402.11758
Given $7 \leq k \leq 9$ points $(x_i,y_i) \in \mathbb{P}^2 \times \mathbb{P}^2$, we characterize rank deficiency of the $k \times 9$ matrix $Z_k$ with rows $x_i^\top \otimes y_i^\top$, in terms of the geometry of the point sets $\{x_i\}$ and $\{y_i\}
Externí odkaz:
http://arxiv.org/abs/2308.02757
We propose an approach to graph sparsification based on the idea of preserving the smallest $k$ eigenvalues and eigenvectors of the Graph Laplacian. This is motivated by the fact that small eigenvalues and their associated eigenvectors tend to be mor
Externí odkaz:
http://arxiv.org/abs/2306.06204
Given $k \leq 6$ points $(x_i,y_i) \in \mathbb{P}^2 \times \mathbb{P}^2$, we characterize rank deficiency of the $k \times 9$ matrix $Z_k$ with rows $x_i^\top \otimes y_i^\top$ in terms of the geometry of the point configurations $\{x_i\}$ and $\{y_i
Externí odkaz:
http://arxiv.org/abs/2301.09826
Publikováno v:
JFoCM, 2022
We introduce an atlas of algebro-geometric objects associated with image formation in pinhole cameras. The nodes of the atlas are algebraic varieties or their vanishing ideals related to each other by projection or elimination and restriction or spec
Externí odkaz:
http://arxiv.org/abs/2206.13468
Let $G=(V,E)$ be a $d$-regular graph on $n$ vertices and let $\mu_0$ be a probability measure on $V$. The act of moving to a randomly chosen neighbor leads to a sequence of probability measures supported on $V$ given by $\mu_{k+1} = A D^{-1} \mu_k$,
Externí odkaz:
http://arxiv.org/abs/2206.05346
Autor:
Babecki, Catherine, Thomas, Rekha R.
A graphical design is a subset of graph vertices such that the weighted averages of certain graph eigenvectors over the design agree with their global averages. We use Gale duality to show that positively weighted graphical designs in regular graphs
Externí odkaz:
http://arxiv.org/abs/2204.01873
Autor:
Thomas, Rekha, Song, Dong, Pourmohamad, Tony, Kurita, Kenji, Chin, Steven, Dai, Lu, Goyon, Alexandre, Medley, Colin D., Gruenhagen, Jason A., Chen, Tao
Publikováno v:
In Journal of Chromatography A 25 January 2024 1715
A fundamental question in computer vision is whether a set of point pairs is the image of a scene that lies in front of two cameras. Such a scene and the cameras together are known as a chiral reconstruction of the point pairs. In this paper we provi
Externí odkaz:
http://arxiv.org/abs/2011.07197