Results 61 to 70 of about 3,587 (160)

SGIR-Tree: Integrating R-Tree Spatial Indexing as Subgraphs in Graph Database Management Systems

open access: yesISPRS International Journal of Geo-Information
Efficient spatial query processing in Graph Database Management Systems (GDBMSs) has become increasingly important owing to the prevalence of spatial graph data.
Juyoung Kim   +4 more
doaj   +1 more source

MLRQ: an efficient labeling scheme for reachability queries on reduced DAGs

open access: yesJournal of King Saud University: Computer and Information Sciences
Answering reachability queries is a fundamental operation in graph theory. Existing methods either build an index for partial reachability, which may lead to costly graph traversal during query processing, or construct an index for complete reachability,
Haiyan Zhang   +2 more
doaj   +1 more source

Dynamic Spanning Tree Coverage With Q-Learning: A Hybrid Framework for Efficient Robot Navigation in Environments With Moving Obstacles

open access: yesIEEE Access
This paper presents a novel hybrid framework that combines Dynamic Spanning Tree Coverage (D-STC) with Q-learning to address the challenges of mobile robot navigation and coverage in dynamic environments. The proposed method enables efficient exploration
K. P. Jayalakshmi   +2 more
doaj   +1 more source

SB-Tree: A B+-Tree for In-Memory Time Series Databases With Segmented Block

open access: yesIEEE Access
Various devices such as smart cars, healthcare systems, and IoT platforms generate a massive amount of time series data. This type of data exhibits unique characteristics that pose new challenges for in-memory indexes, including heavy insert rates ...
Christine Euna Jung   +4 more
doaj   +1 more source

Analysis of Target Electromagnetic Scattering Characteristics Based on Accelerated SBR Algorithm

open access: yesInternational Journal of Antennas and Propagation
Aiming at the inefficiency problem faced when analyzing the electromagnetic scattering characteristics of electrically large-sized targets, this paper, based on the existing bounding volume hierarchy (BVH) tree accelerated data structure commonly used in
Xuanji Wang, Nan Bi, Zhan Meng
doaj   +1 more source

A Hybrid Path Planning Framework for Forest Mowing Using Two-Body-Inspired Orbital Control

open access: yesActuators
Autonomous vegetation management in unstructured forest environments imposes a conflicting requirement: maximizing wide-area coverage while maintaining close-proximity safety around irregular obstacles.
Sun-Ho Jang   +3 more
doaj   +1 more source

Intrusion-resilient Signature Scheme Based on Complete Binary Tree

open access: yes工程科学与技术, 2008
:Through periodically evolving key, intrusion resilient technique can powerfully defend the threat of key exposure.A new tree based intrusion resilient signature scheme (TBIRS) was proposed, and the correctness and security of TBIRS were testified.
doaj  

Efficient Reversible Data Hiding in Encrypted Point Clouds via KD Tree-Based Path Planning and Dual-Model Design

open access: yesMathematics
Reversible data hiding in encrypted point clouds presents unique challenges due to their unstructured geometry, absence of mesh connectivity, and high sensitivity to spatial perturbations. In this paper, we propose an efficient and secure reversible data
Yuan-Yu Tsai   +3 more
doaj   +1 more source

A Lidar Point Cloud Based Procedure for Vertical Canopy Structure Analysis And 3D Single Tree Modelling in Forest

open access: yesSensors, 2008
A procedure for both vertical canopy structure analysis and 3D single tree modelling based on Lidar point cloud is presented in this paper. The whole area of research is segmented into small study cells by a raster net.
Barbara Koch   +2 more
doaj  

Home - About - Disclaimer - Privacy