Every population game defines a vector field on the set of strategy distributions X. The projection dynamic maps each population game to a new vector field: namely, the one closest to the payoff vector field among those that never point outward from X. We investigate the geometric underpinnings of the projection dynamic, describe its basic game-theoretic properties, and establish a number of cl...

Suppose ∑ is the alphabet set and S is the set of strings with equal length over alphabet ∑. The closest substring problem seeks for a substring over ∑ that minimizes the maximum hamming distance with other substrings in S. The closest substring problem is NP-complete. This problem has particular importance in 180 F. Bahredar et al computational biology and coding theory. In this paper we prese...

This letter investigates the employment of vector-perturbation (VP) precoding to convey simultaneously information and energy in multiple-user multiple-input single-output (MU-MISO) downlink channel. We show that conventional VP addition capacity benefits provides linear channel inversion techniques, it enhances harvested at receivers due extended symbol constellation. To further boost harvesti...

In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, which security is related to the hardness of approximating the closest vector problem (CVP) in a lattice. Furthermore, they also described how to use the same principle of their encryption scheme to provide a signature scheme. Practically, this cryptosystem uses the euclidean ...

We write A ≤T B to denote that A is Turing-reducible to B; A is Turing-reducible to a problem B if given an oracle for B, one can compute answers to A. In this case we will show taht if we can compute correct answers for CV Pγ , we can use this to compute the γ-shortest vector of some fixed lattice. Note that the decision formulation of CV P is NP-hard while (the natural decision version of) SV...

A new fast nearest neighbor algorithm is described that uses principal component analysis to build an efficient search tree. At each node in the tree, the data set is partitioned along the direction of maximum variance. The search algorithm efficiently uses a depth-first search and a new elimination criterion. The new algorithm was compared to sixteen other fast nearest neighbor algorithms on t...

The Integer Programming Problem (IP) for a polytope P ⊆ R is to find an integer point in P or decide that P is integer free. We give a randomized algorithm for an approximate version of this problem, which correctly decides whether P contains an integer point or whether a (1 + ) scaling of P around its barycenter is integer free in time O(1/ ) with overwhelming probability. We reduce this appro...

We address the problem of camera motion and structure reconstruction from line correspondences across multiple views, from initialization to final bundle adjustment. One of the main difficulties when dealing with line features is their algebraic representation. First, we consider the triangulation problem. Based on Plücker coordinates to represent the lines, we propose a maximum likelihood algo...

The Integer Programming Problem (IP) for a polytope P ⊆ Rn is to find an integer point in P or decide that P is integer free. We give a randomized algorithm for an approximate version of this problem, which correctly decides whether P contains an integer point or whether a (1+ ǫ) scaling of P around its barycenter is integer free in time O(1/ǫ) with overwhelming probability. We reduce this appr...