Sciweavers

1082 search results - page 8 / 217
» Approximation Algorithms for Spreading Points
Sort
View
COMPGEOM
2001
ACM
13 years 11 months ago
A practical approach for computing the diameter of a point set
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...
Sariel Har-Peled
SOFSEM
2007
Springer
14 years 1 months ago
Fast Approximate Point Set Matching for Information Retrieval
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...
Raphaël Clifford, Benjamin Sach
GBRPR
2005
Springer
14 years 1 months ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
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...
Tibério S. Caetano, Terry Caelli
GECCO
2005
Springer
209views Optimization» more  GECCO 2005»
14 years 1 months ago
Genetic algorithm optimization of superresolution parameters
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...
Barry Ahrens
DAGSTUHL
1997
13 years 8 months ago
Interpolation and Approximation of Surfaces from Three-dimensional Scattered Data Points
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...
Robert Mencl, Heinrich Müller