Sciweavers

2312 search results - page 247 / 463
» On the Dimensionality of Face Space
Sort
View
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
15 years 8 months ago
Robust Clustering in Arbitrarily Oriented Subspaces
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...
Elke Achtert, Christian Böhm, Jörn David...
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
15 years 8 months ago
Navigating nets: simple algorithms for proximity search
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...
Robert Krauthgamer, James R. Lee
WSCG
2004
197views more  WSCG 2004»
15 years 8 months ago
Collision Prediction Using MKtrees
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 ...
Marta Franquesa-Niubó, Pere Brunet
DCC
2010
IEEE
15 years 6 months ago
The small weight codewords of the functional codes associated to non-singular Hermitian varieties
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 ...
Frédéric A. B. Edoukou, Anja Hallez,...
EM
2010
134views Management» more  EM 2010»
15 years 6 months ago
High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
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...
Hans D. Mittelmann, Frank Vallentin