Results 1 to 10 of about 6,963,647 (337)
Voxelisation Algorithms and Data Structures: A Review [PDF]
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
Buildings, 2022 Accurate damage identification is of great significance to maintain timely and prevent structural failure. To accurately and quickly identify the structural damage, a novel two-stage approach based on convolutional neural networks (CNN) and an improved ...
Chunyan Xiang +6 more
doaj +1 more source
IEEE Access, 2022 Verification techniques play an essential role in detecting undesirable behaviors in many applications like spectrum auctions. By verifying an auction design, one can detect the least favorable outcomes, e.g., the lowest revenue of an auctioneer. However,
Elaheh Ordoni +2 more
doaj +1 more source
Fast Hybrid Data Structure for a Large Alphabet K-Mers Indexing for Whole Genome Alignment
IEEE Access, 2021 The most common index data structures used by whole genome aligners (WGA) are based on suffix trees (ST), suffix arrays, and FM-indexes. These data structures show good performance results as WGA works with sequences of letters over small alphabets; for ...
Rostislav Hrivnak +2 more
doaj +1 more source
Remote Sensing, 2021 In this paper, we investigate the performance of six data structures for managing voxelised full-waveform airborne LiDAR data during 3D polygonal model creation.
Milto Miltiadou +3 more
doaj +1 more source
Deep Learning Models for Yoga Pose Monitoring
Algorithms, 2022 Activity recognition is the process of continuously monitoring a person’s activity and movement. Human posture recognition can be utilized to assemble a self-guidance practice framework that permits individuals to accurately learn and rehearse yoga ...
Debabrata Swain +6 more
doaj +1 more source
Error-Correcting Data Structures [PDF]
, 2008 We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries about the object, even if the data structure has been corrupted by a ...
de Wolf, Ronald
core +14 more sources
Oblivious Data Structures [PDF]
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014 We design novel, asymptotically more efficient data structures and algorithms for programs whose data access patterns exhibit some degree of predictability. To this end, we propose two novel techniques, a pointer-based technique and a locality-based technique.
Liu, C +6 more
openaire +2 more sources
Optimal Joins Using Compact Data Structures [PDF]
, 2020 Worst-case optimal join algorithms have gained a lot of attention in the database literature. We now count with several algorithms that are optimal in the worst case, and many of them have been implemented and validated in practice.
Navarro, Gonzalo +2 more
core +2 more sources
Optimal Prefix and Suffix Queries on Texts [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied by Mäkinen and Navarro [Position-Restricted Substring Searching, LATIN 2006].
Maxime Crochemore +2 more
doaj +1 more source