Zobrazeno 1 - 10
of 12 789
pro vyhledávání: '"Laxman AS"'
The SetCover problem has been extensively studied in many different models of computation, including parallel and distributed settings. From an approximation point of view, there are two standard guarantees: an $O(\log \Delta)$-approximation (where $
Externí odkaz:
http://arxiv.org/abs/2408.13362
Autor:
Bateni, MohammadHossein, Dhulipala, Laxman, Fletcher, Willem, Gowda, Kishen N, Hershkowitz, D Ellis, Jayaram, Rajesh, Łącki, Jakub
We give an efficient algorithm for Centroid-Linkage Hierarchical Agglomerative Clustering (HAC), which computes a $c$-approximate clustering in roughly $n^{1+O(1/c^2)}$ time. We obtain our result by combining a new Centroid-Linkage HAC algorithm with
Externí odkaz:
http://arxiv.org/abs/2406.05066
Neural embedding models have become a fundamental component of modern information retrieval (IR) pipelines. These models produce a single embedding $x \in \mathbb{R}^d$ per data-point, allowing for fast retrieval via highly optimized maximum inner pr
Externí odkaz:
http://arxiv.org/abs/2405.19504
Autor:
Choudhary, Anandam, Goswami, Laxman Prasad, Aparajit, C., Lad, Amit D., Parab, Ameya, Ved, Yash M., Das, Amita, Kumar, G. Ravindra
The interaction of intense linearly polarized femtosecond laser pulses with solids is known to generate azimuthal magnetic fields, while circularly polarized light has been shown to create axial fields. We demonstrate through experiments and particle
Externí odkaz:
http://arxiv.org/abs/2405.14375
Autor:
Wheatman, Brian, Dong, Xiaojun, Shen, Zheqi, Dhulipala, Laxman, Łącki, Jakub, Pandey, Prashant, Xu, Helen
A fundamental building block in any graph algorithm is a graph container - a data structure used to represent the graph. Ideally, a graph container enables efficient access to the underlying graph, has low space usage, and supports updating the graph
Externí odkaz:
http://arxiv.org/abs/2405.11671
Computing a Single-Linkage Dendrogram (SLD) is a key step in the classic single-linkage hierarchical clustering algorithm. Given an input edge-weighted tree $T$, the SLD of $T$ is a binary dendrogram that summarizes the $n-1$ clusterings obtained by
Externí odkaz:
http://arxiv.org/abs/2404.19019
This work aims to develop an integrated control strategy for Brushless Direct Current Motors for a wide range of applications in robotics systems. The controller is suited for both high torque - low speed and high-speed control of the motors. Hardwar
Externí odkaz:
http://arxiv.org/abs/2404.17367
Autor:
Bateni, MohammadHossein, Dhulipala, Laxman, Gowda, Kishen N, Hershkowitz, D Ellis, Jayaram, Rajesh, Łącki, Jakub
Average linkage Hierarchical Agglomerative Clustering (HAC) is an extensively studied and applied method for hierarchical clustering. Recent applications to massive datasets have driven significant interest in near-linear-time and efficient parallel
Externí odkaz:
http://arxiv.org/abs/2404.14730
Autor:
Zank, Gary P., Zhao, Lingling, Adhikari, Laxman, Telloni, Daniele, Baruwal, Prashant, Baruwal, Prashrit, Zhu, Xingyu, Nakanotani, Masaru, Pitna, Alexander, Kasper, Justin C., Bale, Stuart D.
Parker Solar Probe (PSP) observed sub-Alfvenic solar wind intervals during encounters 8 - 14, and low-frequency magnetohydrodynamic turbulence in these regions may differ from that in super-Alfvenic wind. We apply a new mode-decomposition analysis (Z
Externí odkaz:
http://arxiv.org/abs/2403.14861
Autor:
Watson, Matthew D., Acharya, Swagata, Nunn, James E., Nagireddy, Laxman, Pashov, Dimitar, Rösner, Malte, van Schilfgaarde, Mark, Wilson, Neil R., Cacho, Cephise
Publikováno v:
npj 2D Materials and Applications 8, 54 (2024)
We present the evolution of the electronic structure of CrSBr from its antiferromagnetic ground state to the paramagnetic phase above T_N=132 K, in both experiment and theory. Low temperature angle-resolved photoemission spectroscopy (ARPES) results
Externí odkaz:
http://arxiv.org/abs/2403.10867