Zobrazeno 1 - 10
of 3 370
pro vyhledávání: '"P. Laxman"'
Autor:
De Man, Quinten, Dhulipala, Laxman, Karczmarz, Adam, Łącki, Jakub, Shun, Julian, Wang, Zhongqi
We study the problem of dynamically maintaining the connected components of an undirected graph subject to edge insertions and deletions. We give the first parallel algorithm for the problem which is work-efficient, supports batches of updates, runs
Externí odkaz:
http://arxiv.org/abs/2411.11781
Autor:
Yu, Shangdi, Shi, Jessica, Meindl, Jamison, Eisenstat, David, Ju, Xiaoen, Tavakkol, Sasan, Dhulipala, Laxman, Łącki, Jakub, Mirrokni, Vahab, Shun, Julian
We introduce the ParClusterers Benchmark Suite (PCBS) -- a collection of highly scalable parallel graph clustering algorithms and benchmarking tools that streamline comparing different graph clustering algorithms and implementations. The benchmark in
Externí odkaz:
http://arxiv.org/abs/2411.10290
Autor:
Simhadri, Harsha Vardhan, Aumüller, Martin, Ingber, Amir, Douze, Matthijs, Williams, George, Manohar, Magdalen Dobson, Baranchuk, Dmitry, Liberty, Edo, Liu, Frank, Landrum, Ben, Karjikar, Mazin, Dhulipala, Laxman, Chen, Meng, Chen, Yue, Ma, Rui, Zhang, Kai, Cai, Yuzheng, Shi, Jiayang, Chen, Yizhuo, Zheng, Weiguo, Wan, Zihao, Yin, Jie, Huang, Ben
The 2023 Big ANN Challenge, held at NeurIPS 2023, focused on advancing the state-of-the-art in indexing data structures and search algorithms for practical variants of Approximate Nearest Neighbor (ANN) search that reflect the growing complexity and
Externí odkaz:
http://arxiv.org/abs/2409.17424
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