Results 31 to 40 of about 492,500 (284)

A randomized CPA-secure asymmetric-key chaotic color image encryption scheme based on the Chebyshev mappings and one-time pad

Journal of King Saud University: Computer and Information Sciences, 2021
Highlights: • A novel chaotic asymmetric-key color image encryption algorithm is proposed. • The multiplicative coupled Chebyshev-based encryption scheme allows arbitrary sizes of keyspace.
Ali Shakiba
doaj   +1 more source

On the Randomized Kaczmarz Algorithm

, 2014
The Randomized Kaczmarz Algorithm is a randomized method which aims at solving a consistent system of over determined linear equations. This note discusses how to find an optimized randomization scheme for this algorithm, which is related to the question
Dai, Liang, Pelckmans, Kristiaan, Soltanalian, Mojtaba   +2 more
core   +1 more source

Online Disjoint Set Cover Without Prior Knowledge [PDF]

, 2019
The disjoint set cover (DSC) problem is a fundamental combinatorial optimization problem concerned with partitioning the (hyper)edges of a hypergraph into (pairwise disjoint) clusters so that the number of clusters that cover all nodes is maximized.
Emek, Yuval, Goldbraikh, Adam, Kantor, Erez   +2 more
core   +1 more source

Extension of Sparse Randomized Kaczmarz Algorithm for Multiple Measurement Vectors

, 2014
The Kaczmarz algorithm is popular for iteratively solving an overdetermined system of linear equations. The traditional Kaczmarz algorithm can approximate the solution in few sweeps through the equations but a randomized version of the Kaczmarz algorithm
Aggarwal, Hemant Kumar, Majumdar, Angshul   +1 more
core   +1 more source

On Approximating Multi-Criteria TSP [PDF]

, 2009
We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP). First, we devise randomized approximation algorithms for multi-criteria maximum traveling salesman problems (Max-TSP).
Manthey, Bodo
core   +11 more sources

Massive Fishing Website URL Parallel Filtering Method

IEEE Access, 2018
A randomized fingerprint model is proposed, which can effectively reduce the false positive rate by generating a unique fingerprint for each URL. The model is also used to improve the Wu and Manber (WM) algorithm, which is a multi-string matching ...
Dongliang Xu, Jingchang Pan, Xiaojiang Du, Bailing Wang, Meng Liu, Qinma Kang   +5 more
doaj   +1 more source

Efficient Asynchronous Semi-Stochastic Block Coordinate Descent Methods for Large-Scale SVD

IEEE Access, 2021
Eigenvector computation such as Singular Value Decomposition (SVD) is one of the most fundamental problems in machine learning, optimization and numerical linear algebra.
Fanhua Shang, Zhihui Zhang, Yuanyuan Liu, Hongying Liu, Jing Xu   +4 more
doaj   +1 more source

Reduction of Phase Shifters in Planar Phased Arrays Using Novel Random Subarray Techniques

Applied Sciences
Reducing the number of phase shifters by grouping antenna elements into subarrays has been extensively studied for decades. The number of phase shifters directly affects the cost, complexity, and power consumption of the system.
Juan L. Valle, Marco A. Panduro, Carlos del Río Bocio, Carlos A. Brizuela, David H. Covarrubias   +4 more
doaj   +1 more source

Probability-boosting technique for combinatorial optimization [PDF]

PeerJ Computer Science
In many combinatorial optimization problems we want a particular set of k out of n items with some certain properties (or constraints). These properties may involve the k items.
Sanpawat Kantabutra
doaj   +2 more sources

Online Permutation Routing in Partitioned Optical Passive Star Networks

, 2005
This paper establishes the state of the art in both deterministic and randomized online permutation routing in the POPS network. Indeed, we show that any permutation can be routed online on a POPS network either with $O(\frac{d}{g}\log g)$ deterministic ...
Mei, Alessandro, Rizzi, Romeo
core   +1 more source