Zobrazeno 1 - 10
of 207
pro vyhledávání: '"Krishnamoorthy, Bala"'
Autor:
Ferracina, Fabiana, Beeler, Payton, Halappanavar, Mahantesh, Krishnamoorthy, Bala, Minutoli, Marco, Fierce, Laura
Aerosol effects on climate, weather, and air quality depend on characteristics of individual particles, which are tremendously diverse and change in time. Particle-resolved models are the only models able to capture this diversity in particle physioc
Externí odkaz:
http://arxiv.org/abs/2409.13861
We define a new framework that unifies the filtration and mapper approaches from TDA, and present efficient algorithms to compute it. Termed the box filtration of a PCD, we grow boxes (hyperrectangles) that are not necessarily centered at each point
Externí odkaz:
http://arxiv.org/abs/2404.05859
Autor:
Ferracina, Fabiana, Krishnamoorthy, Bala, Halappanavar, Mahantesh, Hu, Shengwei, Sathuvalli, Vidyasagar
We explore the application of machine learning algorithms specifically to enhance the selection process of Russet potato clones in breeding trials by predicting their suitability for advancement. This study addresses the challenge of efficiently iden
Externí odkaz:
http://arxiv.org/abs/2404.03701
We study the problem of comparing a pair of geometric networks that may not be similarly defined, i.e., when they do not have one-to-one correspondences between their nodes and edges. Our motivating application is to compare power distribution networ
Externí odkaz:
http://arxiv.org/abs/2403.12334
Given a bipartite graph $G(V= (A \cup B),E)$ with $n$ vertices and $m$ edges and a function $b \colon V \to \mathbb{Z}_+$, a $b$-matching is a subset of edges such that every vertex $v \in V$ is incident to at most $b(v)$ edges in the subset. When we
Externí odkaz:
http://arxiv.org/abs/2403.05781
We design and implement two single-pass semi-streaming algorithms for the maximum weight $k$-disjoint matching ($k$-DM) problem. Given an integer $k$, the $k$-DM problem is to find $k$ pairwise edge-disjoint matchings such that the sum of the weights
Externí odkaz:
http://arxiv.org/abs/2311.02073
Persistence diagrams (PDs) are used as signatures of point cloud data. Two clouds of points can be compared using the bottleneck distance d_B between their PDs. A potential drawback of this pipeline is that point clouds sampled from topologically sim
Externí odkaz:
http://arxiv.org/abs/2306.06727
Autor:
Welankar, Sejal, Pesantez-Cabrera, Paola, Krishnamoorthy, Bala, Mills, Lynn, Keller, Markus, Kalyanaraman, Ananth
Persistent homology is a branch of computational algebraic topology that studies shapes and extracts features over multiple scales. In this paper, we present an unsupervised approach that uses persistent homology to study divergent behavior in agricu
Externí odkaz:
http://arxiv.org/abs/2302.05600
Publikováno v:
International Journal of Organizational Analysis, 2023, Vol. 32, Issue 4, pp. 681-701.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/IJOA-01-2023-3581
The massive integration of distributed energy resources changes the operational demands of the electric power distribution system, motivating optimization-based approaches. The added computational complexities of the resulting optimal power flow (OPF
Externí odkaz:
http://arxiv.org/abs/2210.17465