Given a set of points in any constant dimension, each of which is associated with a time during which that point is active, we design a data structure with O(n log n) space that can find the closest pair of active points within a query interval of time in O(log log n) time using a quadtree-based approach in the word-RAM model.

We propose a new cryptographic notion called generalized closest substring encryption. In this notion, a ciphertext encrypted with a string S can be decrypted with a private key of another string S′, if there exist a substring of S, i.e. Ŝ, and a substring of S′, i.e. Ŝ′, that are “close” to each other measured by their “overlap distance”. The overlap distance between Ŝ and Ŝ′ is the number of ...

Vasily Surikov’s and Piotr Konchalovsky’s kinship, the kinship of representatives different generations Russian art various creative aspirations, is considered in aspect interconnections context cultural processes early 20th century. Here it should be remembered their similar modus vivendi, joint trips to Siberia, Surikovʼs homeland, Krasnoyarsk, also Europe – Germany, or France, Spain; common ...

The iterative closest point (ICP) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The basis of the algorithm is the minimization of an error function that takes point correspondences into account. Four closed-form solution methods are known for minimizing this function. This paper presents novel linear so...

This paper proposes a novel scheme for target localization in unknown environments using a prior-deployed static wireless sensor network (WSN). The goal is to have multiple mobile autonomous robots navigate from any point in a region to the closest identified target location just by interacting with the sensors. This is achieved in two ways: (i) by producing a pseudogradient in the region havin...

A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice L represented by some basis, and a target point y, nd the lattice point closest to y. Bounded Distance Decoding is a variant of this problem in which the target is guaranteed to be close to the lattice, relative to the minimum distance 1(L) of the lattice. Speci cally, in the -Bounded Distance ...