Results 31 to 40 of about 36,225 (338)

Divide-and-conquer algorithms on the hypercube

Theoretical Computer Science, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mayr, Ernst W, Werchner, Ralph
openaire   +2 more sources

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems [PDF]

Algorithmica, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Okumoto, Kazumasa, Fukunaga, Takuro, Nagamochi, Hiroshi   +2 more
openaire   +2 more sources

Benchmark dataset for the convex hull of 2D disks

Data in Brief, 2019
In this paper, we present a benchmark dataset which can be used to evaluate the algorithms to construct the convex hull of 2D disks. The dataset contains disk arrangements including general and extremely biased cases, which are generated by a C++ program.
Chanyoung Song, Joonghyun Ryu, Deok-Soo Kim   +2 more
doaj   +1 more source

An Anti-Noise Fast Circle Detection Method Using Five-Quadrant Segmentation

Sensors, 2023
Extracting circle information from images has always been a basic problem in computer vision. Common circle detection algorithms have some defects, such as poor noise resistance and slow computation speed.
Yun Ou, Honggui Deng, Yang Liu, Zeyu Zhang, Xin Lan   +4 more
doaj   +1 more source

Radix-2 x 2 x 2 algorithm for the 3-D discrete hartley transform [PDF]

, 2001
The discrete Hartley transform (DHT) has proved to be a valuable tool in digital signal/image processing and communications and has also attracted research interests in many multidimensional applications.
Alshibami, O.H., Aziz, M.Y., Boussakta, S.   +2 more
core   +1 more source

A Novel Ensemble Method of Divide-and-Conquer Markov Boundary Discovery for Causal Feature Selection

Mathematics
The discovery of Markov boundaries is highly effective at identifying features that are causally related to the target variable, providing strong interpretability and robustness.
Hao Li, Jianjun Zhan, Haosen Wang, Zipeng Zhao   +3 more
doaj   +1 more source

MODC: A Pareto-Optimal Optimization Approach for Network Traffic Classification Based on the Divide and Conquer Strategy

Information, 2018
Network traffic classification aims to identify categories of traffic or applications of network packets or flows. It is an area that continues to gain attention by researchers due to the necessity of understanding the composition of network traffics ...
Zuleika Nascimento, Djamel Sadok
doaj   +1 more source

A Divide-and-Conquer Algorithm for Computing Voronoi Diagrams

2020 IEEE International Conference on Electro Information Technology (EIT), 2020
Identifying the closest of a set of locations typically requires computing the distance to each of these locations, given a current position. However, Voronoi Diagrams precompute the geometric areas that each of these locations is closest to in order to ameliorate the cost of computing distances later on.
Elijah, Smith, Christian, Trefftz, Byron, DeVries   +2 more
openaire   +3 more sources

Side Channel Analysis of SPECK Based on Transfer Learning

Sensors, 2022
Although side-channel attacks based on deep learning are widely used in AES encryption algorithms, there is little research on lightweight algorithms. Lightweight algorithms have fewer nonlinear operations, so it is more difficult to attack successfully.
Qingqing Zhang, Hongxing Zhang, Xiaotong Cui, Xing Fang, Xingyang Wang   +4 more
doaj   +1 more source

Performance of a Class of Highly-Parallel Divide-and-Conquer Algorithms [PDF]

, 1995
A wide range of important problems have efficient methods of solution based on the divide-and-conquer strategy. However, the traditional approach to parallel divide-and-conquer does not scale well due to the sequential component of the algorithms.
Thornley, John
core   +1 more source