1082 search results - page 8 / 217 » Approximation Algorithms for Spreading Points |
150
click to vote
COMPGEOM
2001
ACM
15 years 9 months ago
2001
ACM
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
191
Voted
SOFSEM
2007
Springer
15 years 12 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
162
click to vote
GBRPR
2005
Springer
15 years 11 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
157
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Superresolution is the process of producing a high resolution image from a collection of low resolution images. This process has potential application in a wide spectrum of fields...
207
Voted
DAGSTUHL
1997
15 years 7 months ago
1997
There is a wide range of applications for which surface interpolation or approximation from scattered data points in space is important. Dependent on the field of application and...