Sciweavers

56 search results - page 4 / 12
» Euclidean Fitting Revisited
Sort
View
ECML
2005
Springer
14 years 3 months ago
Fitting the Smallest Enclosing Bregman Ball
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learnin...
Richard Nock, Frank Nielsen
FLAIRS
2000
13 years 11 months ago
Partitioning Sets with Genetic Algorithms
We first revisit a problem in the literature of genetic algorithms: arranging numbers into groups whose summed weights are as nearly equal as possible. We provide a new genetic al...
William A. Greene
COMPGEOM
1997
ACM
14 years 2 months ago
Approximate Nearest Neighbor Queries Revisited
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
Timothy M. Chan
TSMC
2002
119views more  TSMC 2002»
13 years 9 months ago
Approximation of n-dimensional data using spherical and ellipsoidal primitives
This paper discusses the problem of approximating data points in -dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spher...
Giuseppe Carlo Calafiore
LOGCOM
1998
110views more  LOGCOM 1998»
13 years 9 months ago
leanTAP Revisited
A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...
Melvin Fitting