Sciweavers

72 search results - page 4 / 15
» LAGO on the unit sphere
Sort
View
EM
2010
134views Management» more  EM 2010»
14 years 9 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
SIAMNUM
2010
120views more  SIAMNUM 2010»
14 years 4 months ago
Well Conditioned Spherical Designs for Integration and Interpolation on the Two-Sphere
A set XN of N points on the unit sphere is a spherical t-design if the average value of any polynomial of degree at most t over XN is equal to the average value of the polynomial o...
Congpei An, Xiaojun Chen, Ian H. Sloan, Robert S. ...
74
Voted
ICPR
2006
IEEE
15 years 10 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
40
Voted
ISCAS
2007
IEEE
93views Hardware» more  ISCAS 2007»
15 years 3 months ago
High Speed Sphere Decoding Based on Vertically Incremental Computation
— Sphere decoding enables maximum likelihood (ML) detection with lower complexity than other decoding algorithms, but it still suffers from large computational delay. This paper ...
Se-Hyeon Kang, In-Cheol Park
JGTOOLS
2008
109views more  JGTOOLS 2008»
14 years 9 months ago
Fast Equal-Area Mapping of the (Hemi)Sphere using SIMD
We present a fast vectorized implementation of a transform that maps points in the unit square to the surface of the sphere, while preserving fractional area. The mapping uses the ...
Petrik Clarberg