Results 31 to 40 of about 3,587 (160)

New techniques for trail bounds and application to differential trails in Keccak

IACR Transactions on Symmetric Cryptology, 2017
We present new techniques to efficiently scan the space of high-probability differential trails in bit-oriented ciphers. Differential trails consist in sequences of state patterns that we represent as ordered lists of basic components in order to arrange
Silvia Mella, Joan Daemen, Gilles Van Assche   +2 more
doaj   +1 more source

On Optimal Tree Traversals for Sparse Matrix Factorization [PDF]

2011 IEEE International Parallel & Distributed Processing Symposium, 2011
no ...
Jacquelin, Mathias, Marchal, Loris, Robert, Yves, Uçar, Bora   +3 more
openaire   +3 more sources

An FMM Based on Dual Tree Traversal for Many-Core Architectures

Journal of Algorithms & Computational Technology, 2013
The present work attempts to integrate the independent efforts in the fast N-body community to create the fastest N -body library for many-core and heterogenous architectures.
R. Yokota
doaj   +1 more source

MELEC: Meta-Level Evolutionary Composer [PDF]

Journal of Systemics, Cybernetics and Informatics, 2011
Genetic algorithms (GA’s) are global search mechanisms that have been applied to many disciplines including music composition. Computer system MELEC composes music using evolutionary computation on two levels: the object and the meta. At the object-level,
Andres Calvo, Jennifer Seitzer
doaj  

Discovery of Web Query Interface Based on HTML Features and Hierarchical Clustering [PDF]

Jisuanji gongcheng, 2016
Aiming at the problem that Web Query Interface(WQI)from different Web sites can not be found automatically due to their highly heterogeneous structure,this paper proposes a method to find WQI based on Hyper Text Markup Language(HTML)features and ...
WEI Jiaxin,YE Feiyue
doaj   +1 more source

The modified deep first search algorithm: functional implementation [PDF]

Computer Science Journal of Moldova
The article includes the modified deep first search algorithm (DFS) that allows, at a single traversal of a graph, to check its connectivity/biconnectivity, highlight the cut vertices, and build the spanning tree, the biconnected components, and the ...
Constantin Ciubotaru
doaj   +1 more source

Fast Obstacle Avoidance Path Generation Algorithm for Multi-Target Point Coverage Traversal

IEEE Access
Obstacle 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, Chaoyi Sun, Kan Yang, Qing Li   +3 more
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

Comparison of various in-order iterator implementations in C++

Open Computer Science
Data structures typically use sequential or hierarchical arrangements of elements. Hierarchical data structures are commonly referred to as trees. Trees can be implemented and applied in various ways from simple to relatively sophisticated structures ...
Mrena Michal, Varga Michal, Kvaššay Miroslav, Klimo Marek   +3 more
doaj   +1 more source

Efficient implied alignment

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