Results 1 to 10 of about 8,969 (238)
Succinct Data Structure for Path Graphs
Information and Computation, 2022 We consider the problem of designing a succinct data structure for {\it path graphs} (which are a proper subclass of chordal graphs and a proper superclass of interval graphs) on $n$ vertices while supporting degree, adjacency, and neighborhood queries efficiently. We provide the following two solutions for this problem: - an $n \log n+o(n \log n)$-bit
Kunihiko Sadakane, N S Narayanaswamy
exaly +4 more sources
Succinct data structure for dynamic trees with faster queries [PDF]
Theoretical Computer Science, 2019 Navarro and Sadakane [TALG 2014] gave a dynamic succinct data structure for storing an ordinal tree. The structure supports tree queries in either $O(\log n/\log\log n)$ or $O(\log n)$ time, and insertion or deletion of a single node in $O(\log n)$ time.
Dekel Tsur
exaly +3 more sources
Application-Oriented Succinct Data Structures for Big Data [PDF]
The Review of Socionetwork Strategies, 2019 Abstract A data structure is called succinct if its asymptotical space requirement matches the original data size. The development of succinct data structures is an important factor to deal with the explosively increasing big data.
Tetsuo Shibuya, Shibuya Tetsuo
exaly +2 more sources
Succinct data structures for nearest colored node in a tree
Information Processing Letters, 2018 We give a succinct data-structure that stores a tree with colors on the nodes. Given a node x and a color alpha, the structure finds the nearest node to x with color alpha. This results improves the $O(n\log n)$-bits structure of Gawrychowski et al.~[CPM 2016].
Dekel Tsur
exaly +4 more sources
Exploratory Data Analysis in Schools: A Logic Model to Guide Implementation
International Journal of Education Policy and Leadership, 2021 Exploratory data analysis (EDA) is an iterative, open-ended data analysis procedure that allows practitioners to examine data without pre-conceived notions to advise improvement processes and make informed decisions.
Matthew B. Courtney
doaj +1 more source
Origin of the Turbulence Structure in Wall-Bounded Flows, and Implications toward Computability
Fluids, 2021 Coordinate-transformed analysis of turbulence transport is developed, which leads to a symmetric set of gradient expressions for the Reynolds stress tensor components.
T.-W. Lee
doaj +1 more source
Interactive Graph Stream Analytics in Arkouda
Algorithms, 2021 Data from emerging applications, such as cybersecurity and social networking, can be abstracted as graphs whose edges are updated sequentially in the form of a stream. The challenging problem of interactive graph stream analytics is the quick response of
Zhihui Du +3 more
doaj +1 more source
PLoS ONE, 2023 Data simulation is fundamental for machine learning and causal inference, as it allows exploration of scenarios and assessment of methods in settings with full control of ground truth.
Ghadi S Al Hajj +2 more
doaj +1 more source
Balancing Heterogeneous Image Quality for Improved Cross-Spectral Face Recognition
Sensors, 2021 Matching infrared (IR) facial probes against a gallery of visible light faces remains a challenge, especially when combined with cross-distance due to deteriorated quality of the IR data. In this paper, we study the scenario where visible light faces are
Zhicheng Cao +3 more
doaj +1 more source
Bayesian inference of ancestral recombination graphs.
PLoS Computational Biology, 2022 We present a novel algorithm, implemented in the software ARGinfer, for probabilistic inference of the Ancestral Recombination Graph under the Coalescent with Recombination.
Ali Mahmoudi +4 more
doaj +1 more source