In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
In this paper, the collision prediction between polyhedra under screw motions and a static scene using a new K dimensional tree data structure (Multiresolution Kdtree, MKtree) is ...
This article studies the small weight codewords of the functional code CHerm(X), with X a non-singular Hermitian variety of PG(N, q2). The main result of this article is that the ...
Abstract. The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and...