27 papers · ranked by Valyu relevance
Evans Teiko Tetteh, Beata Zielosko, Zoran H. Perić, Vlado Delić + 3 more
This study introduces a greedy algorithm for deriving decision rules from decision tree ensembles, targeting enhanced interpretability and generalization in distributed data environments. Decision rules, known for their transparency, provide an accessible method for knowledge extraction from data, facilitating…
Adil Yousif, Samar M. Alqhtani, Mohammed Bakri Bashir, Awad Ali + 9 more
'Rafik Hamza' 'Alzubair Hassan' 'Tawfeeg Mohmmed Tawfeeg' 'Haipeng Dai' 'Xianjun Deng' 'Xiaolong Xu' 'Ning Wang' 'Zhenzhe Zheng' 'Weijun Wang'] The Internet of Things (IoT) is defined as interconnected digital and mechanical devices with intelligent and interactive data transmission features over a defined network. The…
Guangling Sun, Rui Qi, Yulong Liu, Feng Xu + 1 more
Urbanization has led to accelerated traffic congestion, posing a significant obstacle to urban development. Traditional traffic signal scheduling methods are often inefficient and cumbersome, resulting in unnecessary waiting times for vehicles and pedestrians, exacerbating the traffic situation. To address this issue…
Raka Jovanović, Abdelkader Bousselham, Stefan Voß
In this paper we present a greedy algorithm for solving the problem of the maximum partitioning of graphs with supply and demand (MPGSD). The goal of the method is to solve the MPGSD for large graphs in a reasonable time limit. This is done by using a two stage greedy algorithm, with two corresponding types of…
Kshitij Tayal, Naveen Sivadasan, Rajgopal Srinivasan
We consider the computational problem of phasing an individual genotype sample given a collection of known haplotypes in the population. We give a fast and accurate algorithm GPhase for reconstructing haplotype pair consistent with input genotype. It uses the coalescent based mutation model of Stephens and Donnelly…
Andreas Darmann, Gaia Nicosia, Ulrich Pferschy, Joachim Schauer
Title: Highlights 1. • A game theoretic version of the Subset Sum problem is considered. 2. • Two agents take turns to fill a shared knapsack with their items. 3. • Natural heuristic strategies are proposed and analyzed from a worst-case perspective.
Salim Bouamama, Christian Blum, Pedro Pinacho-Davidson, Viorel Minzu
Finding dominating sets in graphs is very important in the context of numerous real-world applications, especially in the area of wireless sensor networks. This is because network lifetime in wireless sensor networks can be prolonged by assigning sensors to disjoint dominating node sets. The nodes of these sets are…
Alen Alexanderian
where f : P( V ) → R is a non-negative monotone submodular function with the property that f(∅) = 0. Solving such problems by an exhaustive search is extremely challenging. This would require n k evaluations of f, which is prohibitive even for modest values of n and k. 3 In this note, we discuss approximate 3 For…
Saurabh Aggarwal, Joy Kuri, Rahul Vaze
—We consider a "Social Group" of networked nodes, seeking a "universe" of segments. Each node has subset of the universe, and access to an expensive resource for downloading data. Alternatively, nodes can also acquire the universe by exchanging segments among themselves, at low cost, using a local network interface.…
Marko Mitrovic, Moran Feldman, Andreas Krause, Amin Karbasi
In a nutshell, submodular functions encode an intuitive notion of diminishing returns. As a result, submodularity appears in many important machine learning tasks such as feature selection and data summarization. Although there has been a large volume of work devoted to the study of submodular functions in recent…
Juanjo Bermúdez
Genome assembly is a fundamental tool for biological research. Particularly, in microbiology, where budgets per sample are often scarce, it can make the difference between an inconclusive result and a fully valid conclusion. Identifying new strains or estimating the relative abundance of quasi-species in a sample are…
Zhang, Liding, Ling, Yao + 8 more
—Bidirectional motion planning often reduces planning time compared to its unidirectional counterparts. It requires connecting the forward and reverse search trees to form a continuous path. However, this process could fail and restart the asymmetric bidirectional search due to the limitations of lazyreverse search. To…
Fatima Salma Sadek, Khaled Belkadi, Abdelhafid Abouaissa, Pascal Lorenz + 3 more
'Pascal Lorenz' 'Rafael Pastor Vargas' 'Llanos Tobarra' 'Antonio Robles-Gómez'] One of the central communication infrastructures of the Internet of Things (IoT) is the IEEE 802.15.4 standard, which defines Low Rate Wireless Personal Area Networks (LR- WPAN). In order to share the medium fairly in a non-beacon-enabled…
Qianxiang Ai, Joshua Schrier
In a recent paper in this journal (Chem. Mater. 2022, 34, 2545-2552), Twyman et al. studied the environmental stability of crystals by introducing a greedy heuristic algorithm for determining possible oxidation reactions. We show how the problem can be solved exactly, with less code and comparable computational time by…
Bendegúz Sulyok, Gergely Palla
Finding the optimal embedding of networks into low-dimensional hyperbolic spaces is a challenge that received considerable interest in recent years, with several different approaches proposed in the literature. In general, these methods take advantage of the exponentially growing volume of the hyperbolic space as a…
Pierre Leone, Kasun Samarasinghe
> Abstract. Geographic routing is an appealing routing strategy that uses the location information of the nodes to route the data. This technique uses only local information of the communication graph topology and does not require computational effort to build routing table or equivalent data structures. A particularly…
Allan Borodin, Christodoulos Karavasilis, Denis Pankratov
We perform an experimental study of algorithms for online bipartite matching under the known i.i.d. input model with integral types. In the last decade, there has been substantial effort in designing complex algorithms with the goal of improving worst-case approximation ratios. Our goal is to determine how these…
Authors not listed
The identification of kinetically feasible reaction pathways that connect a reactant to its product, including numerous intermediates and transition states, is crucial for predicting chemical reactions and elucidating reaction mechanisms. However, as molecular systems become increasingly complex or larger, the number…
Wei Li, Sisi Zlatanova, Giorgio Terracina
Geo-social community detection over location-based social networks combining both location and social factors to generate useful computational results has attracted increasing interest from both industrial and academic communities. In this paper, we formulate a novel community model, termed geo-social group (GSG), to…
Diego Darriba, David Posada
Several strategies have been proposed to assign substitution models in phylogenomic datasets, or partitioning. The accuracy of these methods, and most importantly, their impact on phylogenetic estimation has not been thoroughly assessed using computer simulations. We simulated multiple partitioning scenarios to…
Authors not listed
For applications in gas sensing, purification, and capture, we often wish to search a large set of metal-organic frameworks (MOFs) for the top-K in terms of their Henry coefficient of an adsorbate. A molecular simulation to predict the Henry coefficient of a MOF constitutes a Monte Carlo integration where each sample…
Benjamin T. James, Brian B. Luczak, Hani Z. Girgis
Sequence clustering is a fundamental step in analyzing DNA sequences. Widely-used software tools for sequence clustering utilize greedy approaches that are not guaranteed to produce the best results. These tools are sensitive to one parameter that determines the similarity among sequences in a cluster. Often times, a…
Paul Francoeur, Daniel Penaherrera, David Koes
The immense size of chemical space, the relative scarcity of high quality data, and the cost of running experiments to accurately measure molecular properties makes active learning (AL) an attractive approach to efficiently explore the space and train high-quality models for molecular property prediction. While AL is…
Authors not listed
Machine olfaction—the artificial replication of the sense of smell—faces significant challenges due to the absence of large, standardized training datasets. Unlike vision, language, and audio models, which benefit from extensive corpora such as ImageNet, GLUE, and AudioSet, olfaction lacks scaled equivalents and…
Ragnar Groot Koerkamp, Igor Martayan
Because of the rapidly-growing amount of sequencing data, computing sketches of large textual datasets has become an essential preprocessing task. These sketches are typically much smaller than the input sequences, but preserve sufficient information for downstream analysis. Minimizers are an especially popular…
Jonas Verhellen
Computer-assisted design of small molecules has experienced a resurgence in academic and indus- trial interest due to the widespread use of data-driven techniques such as deep generative models. While the ability to generate molecules that fulfill required chemical properties is encouraging, the use of deep learning…
Mikko Rautiainen, Veli Mäkinen, Tobias Marschall
Graphs are commonly used to represent sets of sequences. Either edges or nodes can be labeled by sequences, so that each path in the graph spells a concatenated sequence. Examples include graphs to represent genome assemblies, such as string graphs and de Bruijn graphs, and graphs to represent a pan-genome and hence…