Results 41 to 50 of about 41,749 (283)
BMC Bioinformatics, 2020 Background Given a binary tree T $\mathcal {T}$ of n leaves, each leaf labeled by a string of length at most k, and a binary string alignment function ⊗, an implied alignment can be generated to describe the alignment of a dynamic homology for T ...
Alex J. Washburn, Ward C. Wheeler
doaj +1 more source
Secure Two-Party Decision Tree Classification Based on Function Secret Sharing
Complexity, 2023 Decision tree models are widely used for classification tasks in data mining. However, privacy becomes a significant concern when training data contain sensitive information from different parties.
Kun Liu, Chunming Tang
doaj +1 more source
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs
, 2017 Depth first search (DFS) tree is a fundamental data structure for solving graph problems. The classical algorithm [SiComp74] for building a DFS tree requires $O(m+n)$ time for a given graph $G$ having $n$ vertices and $m$ edges. Recently, Baswana et al. [
Khan, Shahbaz
core +1 more source
DMVP: Foremost Waypoint Coverage of Time-Varying Graphs [PDF]
, 2014 We consider the Dynamic Map Visitation Problem (DMVP), in which a team of agents must visit a collection of critical locations as quickly as possible, in an environment that may change rapidly and unpredictably during the agents' navigation.
Aaron, Eric +2 more
core +1 more source
Fast Obstacle Avoidance Path Generation Algorithm for Multi-Target Point Coverage Traversal
IEEE AccessObstacle avoidance path planning with multi-target point coverage traversal has high computational complexity and long solution time, in this paper, the problem of generating the initial obstacle avoidance coverage path is decomposed into two subproblems
Pengpeng Guo +3 more
doaj +1 more source
Tree-Independent Dual-Tree Algorithms [PDF]
, 2013 Dual-tree algorithms are a widely used class of branch-and-bound algorithms. Unfortunately, developing dual-tree algorithms for use with different trees and problems is often complex and burdensome.
Anderson, David V. +5 more
core
Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs
, 2019 We show that the class of chordal claw-free graphs admits LREC$_=$-definable canonization. LREC$_=$ is a logic that extends first-order logic with counting by an operator that allows it to formalize a limited form of recursion.
Grußien, Berit
core +1 more source
2D Magnetic and Topological Quantum Materials and Devices for Ultralow Power Spintronics
Advanced Functional Materials, Volume 36, Issue 44, 1 June 2026.2D magnets and topological quantum materials enable ultralow‐power spintronics by combining robust magnetic order with symmetry‐protected, Berry‐curvature‐driven transport. Fundamentals of 2D anisotropy and spin‐orbit‐coupling induced band inversion are linked to scalable growth and vdW stacking.
Brahmdutta Dixit +5 more
wiley +1 more source
The traversal method for user address space in Windows 10 system based on VAD tree
Xibei Gongye Daxue Xuebao, 2022 The existing traversal method for user address space in the memory forensic research is only applicable to Windows XP and Windows 7 32-bit system. Windows 10 64-bit system is currently used by most users, which is the main target of network attackers.
ZHAI Jiqiang +3 more
doaj +1 more source
Advanced Functional Materials, EarlyView.Lipidic nanoparticles (LNPs) were incubated with 21 gut bacteria frequently associated with the human microbiome. SAXS revealed that ∼75% of tested species induced structural transformations in monoolein LNPs, whereas phytantriol and phospholipid formulations remained unaffected.
Jonathan Caukwell +7 more
wiley +1 more source