10 papers · ranked by Valyu relevance
Andrew Ensinger, Gabriel Kulp, Victor Agostinelli, Dennis Lyakhov + 1 more
Applications Authors: ['Andrew Ensinger' 'Gabriel Kulp' 'Victor Agostinelli' 'Dennis Lyakhov' 'Lizhong Chen'] In scientific fields such as quantum computing, physics, chemistry, and machine learning, high dimensional data are typically represented using sparse tensors. Tensor contraction is a popular operation on…
Marco Bornstein, Tahseen Rabbani, Evan Wang, Amrit Singh Bedi + 1 more
'Furong Huang'] The decentralized Federated Learning (FL) setting avoids the role of a potentially unreliable or untrustworthy central host by utilizing groups of clients to collaboratively train a model via localized training and model/gradient sharing. Most existing decentralized FL algorithms require synchronization…
Tom Theuns, Aidan B. G. Chalk, Matthieu Schaller, Pedro Gonnet
Simulations of galaxy formation follow the gravitational and hydrodynamical interactions between gas, stars and dark matter through cosmic time. The huge dynamic range of such calculations severely limits strong scaling behaviour of the community codes in use, with load-imbalance, cache inefficiencies and poor…
Nitin Jonathan Myers, Amine Mezghani, Robert W. Heath
—Next generation wireless networks will exploit the large amount of spectrum available at millimeter wave (mmWave) frequencies. Design of mmWave systems, however, is challenging due to strict power, cost and hardware constraints at higher bandwidths. To achieve a good SNR for communication, mmWave systems use large…
Ammar Muqaddas
—An industrial grade Quicksort function along with its new algorithm is presented. Compared to 4 other well known implementations of Quicksort, the new algorithm reduces both the number of comparisons and swaps in most cases while staying close to the best of the 4 in worst cases. We trade space for performance, at the…
Azza E. Ahmed, Jacob Heldenbrand, Yan Asmann, Faisal M. Fadlelmola + 11 more
'Daniel S. Katz' 'Katherine Kendig' 'Matthew C. Kendzior' 'Tiffany Li' 'Yingxue Ren' 'Elliott Rodriguez' 'Matthew R. Weber' 'Justin M. Wozniak' 'Jennie Zermeno' 'Liudmila S. Mainzer' 'Li Chen'] Bioinformatics research is frequently performed using complex workflows with multiple steps, fans, merges, and conditionals.…
Fabio F. de Oliveira, Leonardo A. Dias, Marcelo A. C. Fernandes
In bioinformatics, alignment is an essential technique for finding similarities between biological sequences. Usually, the alignment is performed with the Smith-Waterman (SW) algorithm, a well-known sequence alignment technique of high-level precision based on dynamic programming. However, given the massive data volume…
Matija Korpar, Martin Šošić, Dino Blažeka, Mile Šikić
The deluge of next-generation sequencing (NGS) data and expanding database poses higher requirements for protein similarity search. State-of-the-art tools such as BLAST are not fast enough to cope with these requirements. Because of that it is necessary to create new algorithms that will be faster while keeping similar…
Eugenio Angriman, Alexander van der Grinten, Henning Meyerhenke
—In network analysis and graph mining, closeness centrality is a popular measure to infer the importance of a vertex. Computing closeness efficiently for individual vertices received considerable attention. The N P-hard problem of group closeness maximization, in turn, is more challenging: the objective is to find a…
Kristiina Rahkema, Dietmar Pfahl, Rudolf Ramler, Daniel Graziotin
Adding dependencies to third-party libraries through package managers is a common practice in software development. The evolution of library dependency networks has been analyzed for many package managers. There are, however, no studies on how the library dependency networks of multiple package managers behave in the…