Results 1 to 10 of about 662,426 (168)
Competitive Data-Structure Dynamization [PDF]
ACM Transactions on Algorithms, 2021 Data-structure dynamization is a general approach for making static data structures dynamic. It is used extensively in geometric settings and in the guise of so-called merge (or compaction) policies in big-data databases such as LevelDB and Google Bigtable.
Claire Mathieu +3 more
openaire +5 more sources
Buffering updates enables efficient dynamic de Bruijn graphs
Computational and Structural Biotechnology Journal, 2021 Motivation: The de Bruijn graph has become a ubiquitous graph model for biological data ever since its initial introduction in the late 1990s. It has been used for a variety of purposes including genome assembly (Zerbino and Birney, 2008; Bankevich et al.
Jarno Alanko +4 more
doaj +1 more source
THE USE OF DYNAMIC DATA PROCESSING STRUCTURES ON THE EXAMPLE OF LIST TRANSFORMATION TASKS
Современная наука и инновации, 2022 Introduction Information processing is a key operation with information. In this regard, the study mainstreams the issue of choosing the structural organisation of data for the purposes of organising the processing operation.
D. V. Zdor
doaj +1 more source
Engineering Grammar-Based Type Checking for Graph Rewriting Languages
IEEE Access, 2022 The ability to handle evolving graph structures is important both for programming languages and modeling languages. Of various languages that adopt graphs as primary data structures, a graph rewriting language LMNtal provides features of both (concurrent)
Naoki Yamamoto, Kazunori Ueda
doaj +1 more source
More dynamic data structures for geometric set cover with sublinear update time
Journal of Computational Geometry, 2022 We study geometric set cover problems in dynamic settings, allowing insertions and deletions of points and objects. We present the first dynamic data structure that can maintain an $O(1)$-approximation in sublinear update time for set cover for axis ...
Timothy Chan, Qizheng He
doaj +1 more source
A data structure for dynamic trees [PDF]
Journal of Computer and System Sciences, 1981 AbstractA data structure is proposed to maintain a collection of vertex-disjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n) time.
Daniel Dominic Sleator +1 more
openaire +2 more sources
Dynamic data structures for interval coloring [PDF]
Theoretical Computer Science, 2020 We consider the dynamic graph coloring problem restricted to the class of interval graphs. At each update step the algorithm is presented with an interval to be colored, or a previously colored interval to delete. The goal of the algorithm is to efficiently maintain a proper coloring of the intervals with as few colors as possible by an online ...
Girish Raguvir J +2 more
openaire +2 more sources
Dynamic deferred data structuring [PDF]
Information Processing Letters, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ching, Y., Mehlhorn, K., Smid, M.
openaire +2 more sources
Sensors, 2023 An event of sensor faults in sensor networks deployed in structures might result in the degradation of the structural health monitoring system and lead to difficulties in structural condition assessment.
Yoon-Soo Shin, Junhee Kim
doaj +1 more source
Inferring biological structures from super-resolution single molecule images using generative models. [PDF]
PLoS ONE, 2012 Localization-based super resolution imaging is presently limited by sampling requirements for dynamic measurements of biological structures. Generating an image requires serial acquisition of individual molecular positions at sufficient density to define
Suvrajit Maji, Marcel P Bruchez
doaj +1 more source