Results 11 to 20 of about 347,865 (289)
DATA STRUCTURES AND ALGORITHMS
, 2023 The topic of "Data Structures and Algorithms" is a fundamental subject in the field of computer science and programming. It covers the organization and management of data, as well as the development and analysis of algorithms. This topic is crucial for software developers, computer scientists, and anyone working with computers.
Djangazova, Qumriniso +3 more
core +4 more sources
Voxelisation Algorithms and Data Structures: A Review
Sensors, 2021 Voxel-based data structures, algorithms, frameworks, and interfaces have been used in computer graphics and many other applications for decades. There is a general necessity to seek adequate digital representations, such as voxels, that would secure ...
Mitko Aleksandrov +2 more
doaj +2 more sources
DATA STRUCTURES AND ALGORITHMS
Data structures and algorithms serve as the cornerstone of efficient computational problemsolving, enabling the organization and manipulation of data with optimal resource utilization. This chapter delves into foundational data structures, including arrays, linked lists, stacks, queues, and trees, alongside critical algorithms for sorting (e.g ...
Monu Sharma +4 more
+18 more sources
Design of data structures for terrain reference navigation [PDF]
, 1994 This thesis describes the design of a data structure for use with Digitised Terrain Elevation Data (DTED) in Terrain Reference Navigation (TRN) systems.
Gia, M. C.
core +4 more sources
Algorithms and Data Structures for Hyperedge Queries
ACM Journal of Experimental Algorithmics, 2022 We consider the problem of querying the existence of hyperedges in hypergraphs. More formally, given a hypergraph, we need to answer queries of the form: “Does the following set of vertices form a hyperedge in the given hypergraph?” Our aim is to set up data structures based on hashing to answer these queries as fast as possible.
Bertrand, Jules +3 more
openaire +5 more sources
Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time [PDF]
TheoretiCSIn this work we revisit the elementary scheduling problem $1||\sum p_j U_j$. The goal is to select, among $n$ jobs with processing times and due dates, a subset of jobs with maximum total processing time that can be scheduled in sequence without ...
Nick Fischer, Leo Wennmann
doaj +1 more source
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method [PDF]
TheoretiCSThe simplex method for linear programming is known to be highly efficient in practice, and understanding its performance from a theoretical perspective is an active research topic. The framework of smoothed analysis, first introduced by Spielman and Teng
Sophie Huiberts +2 more
doaj +1 more source
Defective Coloring on Classes of Perfect Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 In Defective Coloring we are given a graph $G$ and two integers $\chi_d$, $\Delta^*$ and are asked if we can $\chi_d$-color $G$ so that the maximum degree induced by any color class is at most $\Delta^*$.
Rémy Belmonte +2 more
doaj +1 more source
3SUM in Preprocessed Universes: Faster and Simpler [PDF]
TheoretiCSWe revisit the 3SUM problem in the \emph{preprocessed universes} setting. We present an algorithm that, given three sets $A$, $B$, $C$ of $n$ integers, preprocesses them in quadratic time, so that given any subsets $A' \subseteq A$, $B' \subseteq B$, $C'
Shashwat Kasliwal +2 more
doaj +1 more source
Improved Combinatorial Approximations for Weighted Correlation Clustering [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe present combinatorial approximation algorithms for the weighted correlation clustering problem. In this problem, we have a set of vertices and two weight values for each pair of vertices, denoting their difference and similarity.
Mojtaba Ostovari, Alireza Zarei
doaj +1 more source