Results 21 to 30 of about 5,370 (228)
Succinct Data Structures for Representing Equivalence Classes [PDF]
Given a partition of an n element set into equivalence classes, we consider time-space tradeoffs for representing it to support the query that asks whether two given elements are in the same equivalence class. This has various applications including for testing whether two vertices are in the same component in an undirected graph or in the same ...
Moshe Lewenstein +2 more
openaire +2 more sources
The security of pipeline systems draws attention increasingly; therefore, a novel method based on neural network and graph theory is proposed for the detection and localization of pipeline networks in this paper.
Dazhong Ma +3 more
doaj +1 more source
A Symbolic Regression Based Residual Useful Life Model for Slewing Bearings
Slewing bearings are vital functional components of large machinery. It is of far reaching significance to study their life prediction and health management. Many studies are based on data-driven approaches.
Peng Ding +3 more
doaj +1 more source
Proving tree algorithms for succinct data structures
Accepted to the 10th International Conference on Interactive Theorem Proving (ITP 2019)
Reynald Affeldt +3 more
openaire +4 more sources
Compact Representation of Association Rule With Sequential Item Mapping Rendering Approach
Association rule mining are widely used to uncover meaningful insights from real-world datasets. However, the complex nature of transactional data, especially when identifying frequent item patterns, poses significant challenges.
Puripat Thongkam +1 more
doaj +1 more source
Knowledge-based annotation of small molecule binding sites in proteins
Background The study of protein-small molecule interactions is vital for understanding protein function and for practical applications in drug discovery.
Panchenko Anna R +5 more
doaj +1 more source
Succinct Data Structures for Families of Interval Graphs [PDF]
We consider the problem of designing succinct data structures for interval graphs with $n$ vertices while supporting degree, adjacency, neighborhood and shortest path queries in optimal time in the $Θ(\log n)$-bit word RAM model. The degree query reports the number of incident edges to a given vertex in constant time, the adjacency query returns true ...
Hüseyin Acan +3 more
openaire +2 more sources
SDSL-Mobile: Enabling space-efficient data structures for mobile applications
This paper presents the process and results of porting the Succinct Data Structure Library 2.0 (SDSL-lite), a robust and well-established open-source C++11 library, to Android platforms.
Alexander Barquero +6 more
doaj +1 more source
External memory BWT and LCP computation for sequence collections with applications
Background Sequencing technologies produce larger and larger collections of biosequences that have to be stored in compressed indices supporting fast search operations.
Lavinia Egidi +3 more
doaj +1 more source
ABSTRACT Background Fertility preservation (FP) is increasingly integrated into the care of pediatric patients exposed to gonadotoxic therapy or conditioning for hematopoietic stem cell transplantation (HSCT), yet perioperative data in infants and toddlers remain scarce.
Kerstin Saalabian +13 more
wiley +1 more source

