Results 11 to 20 of about 11,417,388 (340)
An Algorithm for Fast Multiplication of Kaluza Numbers
This paper presents a new algorithm for multiplying two Kaluza numbers. Performing this operation directly requires 1024 real multiplications and 992 real additions. We presented in a previous paper an effective algorithm that can compute the same result
Aleksandr Cariow +2 more
doaj +1 more source
Fast Grid-Based Refining Segmentation Method in Video-Based Point Cloud Compression
The video-based point cloud compression (V-PCC, ISO/IEC 23090-5) is the state-of-the-art international standard for compressing dynamic point clouds developed by the moving picture experts group (MPEG).
Jieon Kim, Yong-Hwan Kim
doaj +1 more source
Computational aspects of the equivalent-layer technique: review
Equivalent-layer technique is a powerful tool for processing potential-field data in the space domain. However, the greatest hindrance for using the equivalent-layer technique is its high computational cost for processing massive data sets.
Vanderlei C. Oliveira Junior +3 more
doaj +1 more source
Fast simulation of quantum algorithms using circuit optimization [PDF]
Classical simulators play a major role in the development and benchmark of quantum algorithms and practically any software framework for quantum computation provides the option of running the algorithms on simulators.
Gian Giacomo Guerreschi
doaj +1 more source
An Algorithm for Computing All Rough Set Constructs for Dimensionality Reduction
In rough set theory, a construct is an attribute subset with the same ability to discern objects belonging to different classes as the whole set of attributes, while maintaining the similarity between objects belonging to the same class.
Yanir González-Díaz +3 more
doaj +1 more source
Fast Algorithms for Convolutional Neural Networks [PDF]
Deep convolutional neural networks take GPU-days of computation to train on large data sets. Pedestrian detection for self driving cars requires very low latency. Image recognition for mobile phones is constrained by limited processing resources.
Andrew Lavin, Scott Gray
semanticscholar +1 more source
Fast Algorithms for Join Operations on Tree Decompositions [PDF]
Treewidth is a measure of how tree-like a graph is. It has many important algorithmic applications because many NP-hard problems on general graphs become tractable when restricted to graphs of bounded treewidth.
van Leeuwen, Erik Jan +5 more
core +2 more sources
An oscillating second-grade fluid through a rectangular cross duct is studied. A traditional integer time derivative in the kinematic tensors is substituted by a fractional operator that considers the memory characteristics.
Bo Zhang +8 more
doaj +1 more source
New many-parameter Fourier–Clifford transforms
The article shows how ordinary complex-valued Fourier transforms are extended to Cliffordean-valued many-parameter Fourier transforms (MPFCTs). Each MPFCT depends on finite set of independent parameters (angles), which could be changed independently one ...
V. G. Labunets +2 more
doaj +1 more source
Fast Algorithms for Designing Multiple Unimodular Waveforms With Good Correlation Properties [PDF]
In this paper, we develop new fast and efficient algorithms for designing single/multiple unimodular waveforms/codes with good auto- and cross-correlation or weighted correlation properties, which are highly desired in radar and communication systems ...
Yongzhe Li, S. Vorobyov
semanticscholar +1 more source

