9 search results - page 1 / 2 » High-Accuracy Semidefinite Programming Bounds for Kissing Nu... |
EM
2010
13 years 7 months ago
2010
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...
JCT
2007
13 years 7 months ago
2007
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For several dimensions it yields improved upper bounds including some new bounds on...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...