Related papers: MV2-algorithm's clones
We introduce a novel class of rotation invariants of two dimensional curves based on iterated integrals. The invariants we present are in some sense complete and we describe an algorithm to calculate them, giving explicit computations up to…
Modeling of microlensing events poses computational challenges for the resolution of the lens equation and the high dimensionality of the parameter space. In particular, numerical noise represents a severe limitation to fast and efficient…
We survey most of the different types of approximation algorithms which minimize the number of output vertices. We present their main qualities and their inherent drawbacks.
In this work we evaluate different approaches to parallelize computation of convolutional neural networks across several GPUs.
We introduce the notion of multiplication kernels of birational and $D$-module type and give various examples. We also introduce the notion of a semi-classical multiplication kernel associated with an integrable system and discuss its…
The paper discusses numerical implementations of various inversion schemes for generalized V-line transforms on vector fields introduced in [6]. It demonstrates the possibility of efficient recovery of an unknown vector field from five…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
The subject of this paper is multigrid solvers for Helmholtz operators with large wave numbers. Algorithms presented here are variations of the wave-ray solver which is modified to allow efficient solutions for operators with constant,…
We discuss how quantum information distribution can improve the performance of some quantum computation tasks. This distribution can be naturally implemented with different types of quantum cloning procedures. We give two examples of tasks…
We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.
We propose an algorithm to find a lower bound for the number of cyclic codes over any finite field with any given exponent. Besides, we give a formula to find the exponent of BCH codes.
We introduce a $2$-approximation algorithm for the minimum total covering number problem.
In this paper, new block representations of Moore-Penrose inverses for arbitrary complex $2\times2$ block matrices are given. The approach is based on block representations of orthogonal projection matrices.
An iterative method is derived for image reconstruction. Among other attributes, this method allows constraints unrelated to the radiation measurements to be incorporated into the reconstructed image. A comparison is made with the widely…
Code clone detection is involved with detecting duplicated fragments of code within a code base. Detecting these clones is useful for maintenance operations which require editing the clones. The tools developed are expected to be robust…
We derive a simple lower bound for the multi-version coding problem formulated in [1]. We also propose simple algorithms that almost match the lower bound derived. Another lower bound is proven for an extended version of the multi-version…
We study the problem of optimizing nonlinear objective functions over bipartite matchings. While the problem is generally intractable, we provide several efficient algorithms for it, including a deterministic algorithm for maximizing convex…
A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…
A multivariate interpolation formula (MVIF) over finite fields is presented by using the proposed Kronecker delta function. The MVIF can be applied to yield polynomial relations over the base field among homogeneous symmetric rational…
We describe a simple algorithm which, for a given D0L system, returns all factors $v$ such that $v^k$ is in the language of the system for all $k$. This algorithm can be used to decide whether a D0L system is repetitive.