Sciweavers

463 search results - page 76 / 93
» Computing the Hausdorff Distance between Curved Objects
Sort
View
CISS
2007
IEEE
15 years 6 months ago
Sensor Location through Linear Programming with Arrival Angle Constraints
Abstract— In previous work, we established a linear programming framework to determine sensor location from measured link distances between neighboring nodes in a network. Beside...
Camillo Gentile, John Shiu
EVOW
2007
Springer
15 years 5 months ago
Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem
Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated. Acceleration of a memetic algorithm requires focusing ...
Marek Kubiak, Przemyslaw Wesolek
PAKDD
2005
ACM
120views Data Mining» more  PAKDD 2005»
15 years 5 months ago
Speeding-Up Hierarchical Agglomerative Clustering in Presence of Expensive Metrics
In several contexts and domains, hierarchical agglomerative clustering (HAC) offers best-quality results, but at the price of a high complexity which reduces the size of datasets ...
Mirco Nanni
CGF
2005
138views more  CGF 2005»
14 years 11 months ago
Approximation of a Variable Density Cloud of Points by Shrinking a Discrete Membrane
This paper describes a method to obtain a closed surface that approximates a general 3D data point set with non-uniform density. Aside from the positions of the initial data point...
Jordi Esteve, Pere Brunet, Alvar Vinacua
IDA
2005
Springer
15 years 5 months ago
Condensed Nearest Neighbor Data Domain Description
—A simple yet effective unsupervised classification rule to discriminate between normal and abnormal data is based on accepting test objects whose nearest neighbors’ distances ...
Fabrizio Angiulli