16 papers · ranked by Valyu relevance
Richard Mikaël Slevinsky, Hassan Safouhi
In a previous work, we developed an algorithm for the computation of incomplete Bessel functions, which pose as a numerical challenge, based on the G (1) n transformation and Slevinsky-Safouhi formula for differentiation. In the present contribution, we improve this existing algorithm for incomplete Bessel functions by…
Lovis Kwasi Armah, Igor Melnykov
Distances Authors: ['Lovis Kwasi Armah' 'Igor Melnykov'] We conduct extensive experiments on synthetic datasets containing up to ten elliptical clusters, as well as the IRIS dataset. Using the Adjusted Rand Index (ARI) and Normalized Mutual Information (NMI), we demonstrate that our algorithm consistently outperforms…
Alexander Ngu
This paper uses the concept of algorithmic efficiency to present a unified theory of intelligence. Intelligence is defined informally, formally, and computationally. We introduce the concept of Dimensional complexity in algorithmic efficiency and deduce that an optimally efficient algorithm has zero Time complexity…
Ying Yang, Haoyu Chen, Haoshen Wu, Seyyed Ahmad Edalatpanah
Missing data presents a challenge to clustering algorithms, as traditional methods tend to pad incomplete data first before clustering. To combine the two processes of padding and clustering and improve the clustering accuracy, a generalized fuzzy clustering framework is proposed based on optimal completion strategy…
Sarah Kleest-Meißner, Jonas Marasus, Matthias Niewerth
We describe a framework for maintaining forest algebra representations that are of logarithmic height for unranked trees. Such a representations can be computed in O(n) time and updated in O(log(n)) time. The framework is of potential interest for data structures and algorithms for trees whose complexity depend on the…
Rafał Brociek, Józef Szczotka, Mariusz Pleszczyński, Francesca Nanni + 4 more
'Christian Napoli' 'Andrea Murari' 'Teddy Craciunescu' 'Ivan Wyss'] The article presents research on the application of computed tomography with an incomplete dataset to the problem of examining the internal structure of walls. The case of incomplete information in computed tomography often occurs in various…
Weibing Feng, Tiantian Sun
This paper addresses the current existence of attribute reduction algorithms for incomplete hybrid decision-making systems, including low attribute reduction efficiency, low classification accuracy and lack of consideration of unlabeled data types. To address these issues, this paper first redefines the weakly labeled…
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
Before the date of this [Lagrange's] concise and all-embracing formulation of the laws of dynamics there was not available any engine of sufficient power and generality to allow of a thorough and exact exploration of the properties of an ultimate medium, of which the mechanism and mode of action are almost wholly…
Ragheb Raad, Deep Ray, Bino Varghese, Darryl Hwang + 3 more
Image imputation refers to the task of generating a type of medical image given images of another type. This task becomes challenging when the difference between the available images, and the image to be imputed is large. In this manuscript, one such application, derived from the dynamic contrast enhanced computed…
Amirmohammad Farzaneh, Justin P. Coon, Mihai-Alin Badiu, Narsis A. Kiani + 2 more
'Narsis A. Kiani' 'Hector Zenil' 'Jesper Tegnér'] Throughout the years, measuring the complexity of networks and graphs has been of great interest to scientists. The Kolmogorov complexity is known as one of the most important tools to measure the complexity of an object. We formalized a method to calculate an upper…
Moritz Groden, Hannah M. Moessinger, Barbara Schaffran, Javier DeFelipe + 3 more
Investigating and modelling the functionality of human neurons remains challenging due to the technical limitations, resulting in scarce and incomplete 3D anatomical reconstructions. Here we used a morphological modelling approach based on optimal wiring to repair the parts of a dendritic morphology that were lost due…
Chonghuan Zhang, Adarsh Arun, Alexei Lapkin
Computer Aided Synthesis Planning (CASP) development of reaction routes requires understanding of complete reaction structures. However, most reactions in the current databases are missing reaction co-participants. Although reaction prediction and atom mapping tools can predict major reaction participants and trace…
Authors not listed
SynTemp is a framework designed to extract and hierarchically cluster reaction templates from large-scale reaction data repositories. Reaction templates are partial Imaginary Transition State graphs representing the reaction center as well as surrounding context. These graphs are equivalent to Double Pushout graph…
Authors not listed
Identifying synthesis routes from knowledge graphs poses challenges beyond retrosynthesis, including path–finding artifacts and data issues. We introduce “SynGPS”, a novel algorithm that overcomes these limitations by identifying viable routes even with common artifacts. SynGPS can resolve nonsensical cycles…
Samantha Petti, Sean R Eddy
The description of Algorithm 2 at the bottom of page 4 is incorrect. The corrected pseudocode reads like: Ifr < 1/2 then ifv is not adjacent to any vertex in T, addv to S else ifv is not adjacent to any vertex in S, addv to T else ifv is not adjacent to any vertex in S, addv to T else ifv is not adjacent to any vertex…
Michal Dory, Mohsen Ghaffari, Saeed Ilchi
We describe a simple deterministic $O \varepsilon ^{-1}\log \Delta $ round distributed algorithm for $2\alpha +11 + \varepsilon $ approximation of minimum weighted dominating set on graphs with arboricity at most $\alpha$. Here $\Delta$ denotes the maximum degree. We also show a lower bound proving that this round…