248 search results - page 11 / 50 » Geometrical Probability Covering Algorithm |
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
108
Voted
FCT
2009
Springer
15 years 6 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
104
Voted
ISD
1999
Springer
15 years 3 months ago
1999
Springer
One of the primary methods of studying change in the natural and man-made environment is that of comparison of multi-date maps and images of the earth's surface. Such comparis...
125
click to vote
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
In this paper, we present a novel algorithm for partial
intrinsic symmetry detection in 3D geometry. Unlike previous
work, our algorithm is based on a conceptually simple
and st...
85
Voted
FAW
2008
Springer
15 years 1 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...