1274 search results - page 99 / 255 » The Geometry of Coin-Weighing Problems |
IVC
2000
14 years 10 months ago
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
142
click to vote
CAD
2011
Springer
14 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...
112
click to vote
TNN
2010
14 years 4 months ago
2010
We consider the problem of semi-supervised feature selection, where we are given a small amount of labeled examples and a large amount of unlabeled examples. Since a small number ...
PG
1998
IEEE
15 years 2 months ago
1998
IEEE
The construction of shape spaces is studied from a mathematical and a computational viewpoint. A program is outlined reducing the problem to four tasks: the representation of geom...
COMPGEOM
1996
ACM
15 years 2 months ago
1996
ACM
We show that any simply connected (but not necessarily convex) polyhedron with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face t...