Results 41 to 50 of about 37,788,190 (381)
Gamifying Computer Science Education for Z Generation
Information, 2021 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
Abstract Orientable Incidence Structure and Algorithms for Finite Bounded Acyclic Categories. II. Data Structure and Fundamental Operations [PDF]
arXiv, 2023 A data structure for finite bounded acyclic categories has been built, which is useful to encode and manipulate abstract orientable incidence structure. It can be represented as a directed acyclic multigraph with weighted edges, where the weighs encode the algebraic structure between edges.
arxiv
Reverse-Safe Data Structures for Text Indexing [PDF]
, 2020 We introduce the notion of reverse-safe data structures. These are data structures that prevent the reconstruction of the data they encode (i.e., they cannot be easily reversed).
Gabriele Fici +4 more
core +3 more sources
Data Autodiscovery—The Role of the OPD
ISPRS International Journal of Geo-Information, 2016 The importance of open data and the benefits it can offer have received recognition on the international stage with the signing of the G8 Open Data Charter in June 2013.
Adrian J. M. Cox +2 more
doaj +1 more source
Comparison of Advance Tree Data Structures [PDF]
International Journal of Computer Applications (2012) Vol. 41 No.2
pp. 11-21, 2012 Btree and Rtree are two basic index structures; many different variants of them are proposed after them. Different variants are used in specific application for the performance optimization. In this paper different variants of Btree and Rtree are discussed and compared.
arxiv +1 more source
Qubit Data Structures for Analyzing Computing Systems [PDF]
, 2014 Qubit models and methods for improving the performance of software and hardware for analyzing digital devices through increasing the dimension of the data structures and memory are proposed.
Chumachenko, Svetlana +3 more
core +1 more source
Optimum Criteria for Developing Defined Structures [PDF]
Informatică economică, 2008 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
Inductive benchmarking for purely functional data structures [PDF]
, 2001 Every designer of a new data structure wants to know how well it performs in comparison with others. But finding, coding and testing applications as benchmarks can be tedious and time-consuming.
Moss, G E, Runciman, C
core +1 more source
Practical guidelines and the EMLN R package for handling ecological multilayer networks
Methods in Ecology and Evolution, 2023 Network analysis provides a powerful framework to study the complexity underlying the structure, dynamics and function of ecological systems. By now, analysing single‐layered networks is a common practice with clear guidelines and well‐established ...
Noa Frydman +3 more
doaj +1 more source
Synch: A framework for concurrent data-structures and benchmarks [PDF]
arXiv, 2021 The recent advancements in multicore machines highlight the need to simplify concurrent programming in order to leverage their computational power. One way to achieve this is by designing efficient concurrent data structures (e.g. stacks, queues, hash-tables, etc.) and synchronization techniques (e.g.
arxiv