588 search results - page 21 / 118 » Computing the Dimension of Linear Subspaces |
ESA
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
FMSD
2006
13 years 10 months ago
2006
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
APWEB
2010
Springer
14 years 1 months ago
2010
Springer
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...
CAD
2011
Springer
13 years 5 months ago
2011
Springer
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
ECCV
2010
Springer
14 years 14 days ago
2010
Springer
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...