Related papers: MV2-algorithm's clones
Code clones are pairs of code snippets that implement similar functionality. Clone detection is a fundamental branch of automatic source code comprehension, having many applications in refactoring recommendation, plagiarism detection, and…
An algorithm is discussed for converting a class of recursive processes to a parallel system. It is argued that this algorithm can be superior to certain methods currently found in the literature for an important subset of problems. The…
An overview of current multiple alignment systems to date are described.The useful algorithms, the procedures adopted and their limitations are presented.We also present the quality of the alignments obtained and in which cases(kind of…
Factorization of compact wavelet matrices into primitive ones has been known for more than 20 years. This method makes it possible to generate wavelet matrix coefficients and also to specify them by their first row. Recently, a new…
We study quantum cloning machines (QCM) that act on an unknown N-level quantum state and make M copies. We give a formula for the maximum of the fidelity of cloning and exhibit the unitary transformations that realize this optimal fidelity.…
Explicit formulas to calculate MV functions in a basis-free representation are presented for an arbitrary Clifford geometric algebra Cl(p,q). The formulas are based on analysis of the roots of minimal MV polynomial and covers defective MVs,…
The goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed…
The trade-offs among various output fidelities of asymmetric universal cloning machines are investigated. First we find out all the attainable optimal output fidelities for the 1 to 3 asymmetric universal cloning machine and it turns out…
We observe structure in the sequences of quotients and remainders of the Euclidean algorithm with two families of inputs. Analyzing the remainders, we obtain new algorithms for computing modular inverses and representating prime numbers by…
In this paper, we present new applications of our general minimax theorems. In particular, one of them concerns the multiplicity of global minima for the integral functional of the Calculus of Variations.
On an infinite base set X, every ideal of subsets of X can be associated with the clone of those operations on X which map small sets to small sets. We continue earlier investigations on the position of such clones in the clone lattice.
A seminal task in quantum information theory is to realize a device able to produce copies of a generic input state with the highest possible output fidelity, thus realizing an \textit{optimal} quantum cloning machine. Recently, the concept…
The Micali-Vazirani (MV) algorithm for maximum cardinality matching in general graphs, which was published in 1980 \cite{MV}, remains to this day the most efficient known algorithm for the problem. This paper gives the first complete and…
Detecting code clones is relevant to software maintenance and code refactoring. This challenge still presents unresolved cases, mainly when structural similarity does not reflect functional equivalence, though recent code models show…
This paper provides examples of various synchronous and asynchronous signal processing systems for performing optimization, utilizing the framework and elements developed in a preceding paper. The general strategy in that paper was to…
We classify binary minimal clones into seven categories: affine algebras, rectangular bands, $p$-cyclic groupoids, spirals, non-Taylor partial semilattices, melds, and dispersive algebras. Each category has nice enough properties to…
A clone on a set X is a set of finitary operations on X which contains all the projections and is closed under composition. The set of all clones forms a complete lattice Cl(X) with greatest element O, the set of all finitary operations.…
Relational Markov Decision Processes are a useful abstraction for complex reinforcement learning problems and stochastic planning problems. Recent work developed representation schemes and algorithms for planning in such problems using the…
We proposed an algorithm that covers some cases of Hamilton Circuit Problem.
In probabilistic cloning with two auxiliary systems, we consider and compare three different protocols for the success probabilities of cloning. We show that, in certain circumstances, it may increase the success probability to add an…