Sciweavers

ICPR
2010
IEEE
13 years 1 months ago
An Efficient and Stable Algorithm for Learning Rotations
This paper analyses the computational complexity and stability of an online algorithm recently proposed for learning rotations. The proposed algorithm involves multiplicative upda...
Raman Arora, William A. Sethares
DCG
2007
71views more  DCG 2007»
13 years 3 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
CORR
2007
Springer
138views Education» more  CORR 2007»
13 years 3 months ago
Low Density Lattice Codes
— Low density lattice codes (LDLC) are novel lattice codes that can be decoded efficiently and approach the capacity of the additive white Gaussian noise (AWGN) channel. In LDLC...
Naftali Sommer, Meir Feder, Ofir Shalvi
EM
2010
134views Management» more  EM 2010»
13 years 3 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
STOC
1989
ACM
99views Algorithms» more  STOC 1989»
13 years 7 months ago
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
Martin E. Dyer, Alan M. Frieze, Ravi Kannan
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
14 years 3 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala