Sciweavers

702 search results - page 1 / 141
» Covering Spheres with Spheres
Sort
View
DCG
2007
71views more  DCG 2007»
13 years 4 months ago
Covering Spheres with Spheres
Given a sphere of any radius r in an n-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the...
Ilya Dumer
ICPR
2006
IEEE
14 years 5 months ago
A Minimum Sphere Covering Approach to Pattern Classification
In this paper we present a minimum sphere covering approach to pattern classification that seeks to construct a minimum number of spheres to represent the training data and formul...
Jigang Wang, Predrag Neskovic, Leon N. Cooper
C3S2E
2008
ACM
13 years 6 months ago
Integer least squares: sphere decoding and the LLL algorithm
This paper considers the problem of integer least squares, where the least squares solution is an integer vector, whereas the coefficient matrix is real. In particular, we discuss...
Sanzheng Qiao
COMBINATORICS
2007
74views more  COMBINATORICS 2007»
13 years 4 months ago
Bipartite-Uniform Hypermaps on the Sphere
A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that “neighbouring” hypervertices have different colours. It is bipartiteuniform i...
Antonio Breda d'Azevedo, Rui Duarte
CORR
2008
Springer
75views Education» more  CORR 2008»
13 years 4 months ago
Soft-Input Soft-Output Sphere Decoding
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The associated computational complexity often poses significant challenges for practical r...
Christoph Studer, Helmut Bölcskei