Results 41 to 50 of about 42,688,929 (320)
Dynamic Data Structures for Document Collections and Graphs [PDF]
In the dynamic indexing problem, we must maintain a changing collection of text documents so that we can efficiently support insertions, deletions, and pattern matching queries.
Munro, J. Ian +2 more
core +1 more source
Optimum Criteria for Developing Defined Structures [PDF]
Basic aspects concerning distributed applications are presented: definition, particularities and importance. For distributed applications linear, arborescent, graph structures are defined with different versions and aggregation methods.
Ion IVAN +3 more
doaj
Research and development of data compression methods for technical monitoring systems
Objective. The aim of the study is to develop methods for data compression in relation to monitoring systems.Method. The studies were carried out mainly experimentally, by processing data generated by the information-measuring system of the Altai State ...
A. G. Yakunin
doaj +1 more source
Algorithms and Data Structures for Multi-Adaptive Time-Stepping [PDF]
Multi-adaptive Galerkin methods are extensions of the standard continuous and discontinuous Galerkin methods for the numerical solution of initial value problems for ordinary or partial differential equations.
Jansson, Johan, Logg, Anders
core +2 more sources
Gamifying Computer Science Education for Z Generation
Generation Z members use their smart devices as part of their everyday routine. Teaching methods may need to be updated to make learning materials more interesting for this generation.
Hadeel Mohammed Jawad, Samir Tout
doaj +1 more source
Data-driven Modeling and Coordination of Large Process Structures [PDF]
In the engineering domain, the development of complex products (e.g., cars) necessitates the coordination of thousands of (sub-)processes. One of the biggest challenges for process management systems is to support the modeling, monitoring and maintenance
Herbst, Joachim +2 more
core +3 more sources
Deterministic sub-linear space LCE data structures with efficient construction [PDF]
Given a string $S$ of $n$ symbols, a longest common extension query $\mathsf{LCE}(i,j)$ asks for the length of the longest common prefix of the $i$th and $j$th suffixes of $S$. LCE queries have several important applications in string processing, perhaps
Bannai, Hideo +5 more
core +2 more sources
ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen +23 more
wiley +1 more source
YARS-PG: Property Graphs Representation for Publication and Exchange
Graph serialization is a critical aspect of advancing graph-oriented systems and applications. Despite the importance of standardized serialization for property graphs, there is a lack of a universal format encompassing all essential features of graph ...
Lukasz Szeremeta +2 more
doaj +1 more source
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching [PDF]
We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph in o([EQUATION]m) time per update.
Sayan Bhattacharya +2 more
semanticscholar +1 more source

