Related papers: MV2-algorithm's clones
We make an in-depth study of the known border rank (i.e. approximate) algorithms for the matrix multiplication tensor encoding the multiplication of an n x 2 matrix by a 2 x 2 matrix.
In this paper we develop parallel cluster sampling algorithms and show that a multi-chain version is embarrassingly parallel and can be used efficiently for medical image retrieval among other applications.
We address the problem of creating entire and complete maps of software code clones (copy features in data) in a corpus of binary artifacts of unknown provenance. We report on a practical methodology, which employs enhanced suffix data…
The numerical radius of the general $2\times2$ complex matrix is calculated.
We consider recursive decoding for Reed-Muller (RM) codes and their subcodes. Two new recursive techniques are described. We analyze asymptotic properties of these algorithms and show that they substantially outperform other decoding…
An algorithm is given for explicitly computing Penrose diagrams for spacetimes of the form $ds^2 = -f(r)\, dt^2 + f(r)^{-1} \, dr^2 + r^2 \, d\Omega^2$. The resulting diagram coordinates are shown to extend the metric continuously and…
We determine all majority operations on a four-element set that generate a minimal clone.
The impossibility of perfectly copying (or cloning) an arbitrary quantum state is one of the basic rules governing the physics of quantum systems. The processes that perform the optimal approximate cloning have been found in many cases.…
We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…
A novel algorithm for computing the action of a matrix exponential over a vector is proposed. The algorithm is based on a multilevel Monte Carlo method, and the vector solution is computed probabilistically generating suitable random paths…
This Ph.D. thesis provides a comprehensive review of the state-of-the-art in the field of Variational Quantum Algorithms and Quantum Machine Learning, including numerous original contributions. The first chapters are devoted to a brief…
A code clone is a pair of code fragments, within or between software systems that are similar. Since code clones often negatively impact the maintainability of a software system, several code clone detection techniques and tools have been…
We report a detailed analysis of the optical realization [1, 3, 2, 4] of the analogue algorithm described in the first paper of this series [5] for the simultaneous factorization of an exponential number of integers. Such an analogue…
Here we describe a Nuclear Magnetic Resonance (NMR) experiment that uses a three qubit NMR device to implement the one to two approximate quantum cloning network of Buzek et al.
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the…
The aim of this work is the study of the Weinstein $L^2$- multiplier operators on $\mathbb{R}^{d+1}_+$ and we give for them Calder\'on's reproducing formulas and best approximation using the theory of Weinstein transform and reproducing…
We give an overview of the existing algorithms to compute nonunique factorization invariants in finitely generated monoids.
In the last decade, interest in projective MV-algebras has grown greatly; see [1], [5] e [6]. In this paper we establish a necessary and sufficient condition for n elements of the free n-generator MV-algebra to generate a projective…
We show how non-symmetric operads (or multicategories), symmetric operads, and clones, arise from three suitable monads on Cat, each extending to a (pseudo-)monad on the bicategory of categories and profunctors. We also explain how other…
This thesis investigates the design of algorithms for solving min-max optimization problems, which form the mathematical foundation of many modern applications in machine learning, game theory, and optimization. This work offers new…