702 search results - page 17 / 141 » Covering Spheres with Spheres |
105
click to vote
COMPGEOM
2011
ACM
14 years 3 months ago
2011
ACM
A graph G is a k-sphere graph if there are k-dimensional real vectors v1, . . . , vn such that ij ∈ E(G) if and only if the distance between vi
ICRA
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— In this paper we present a new Navigation Function for a sphere world that can be computed locally with limited knowledge of the environment. By requiring smooth and no...
ISCAS
2007
IEEE
15 years 6 months ago
2007
IEEE
— Sphere decoding enables maximum likelihood (ML) detection with lower complexity than other decoding algorithms, but it still suffers from large computational delay. This paper ...
101
click to vote
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
We present two new support vector approaches for ordinal regression. These approaches find the concentric spheres with minimum volume that contain most of the training samples. B...
CCCG
2007
15 years 1 months ago
2007
Given a surface triangulation T of and a subset X of its vertex set V (T), we define a restricted edge contraction as a contraction of an edge connecting X and V (T)−X. Boundar...