Sciweavers

12015 search results - page 335 / 2403
» Interactive Algorithms 2005
Sort
View
127
Voted
AMC
2005
146views more  AMC 2005»
15 years 3 months ago
A functional language to implement the divide-and-conquer Delaunay triangulation algorithm
This paper investigates the implementation of a functional language algorithm for the divide-and-conquer Delaunay triangulation. The global aim is to improve its performance. Up t...
André L. Moura, José R. Camacho, Seb...
CAMP
2005
IEEE
15 years 9 months ago
Restoration of Vertical Line Scratches with a Distributed Genetic Algorithm
— This contribution approaches the problem of scratch restoration in old movies as a optimisation’s problem. The functional based on the statistical properties of the image aro...
Francesco Isgrò, Domenico Tegolo
CEC
2005
IEEE
15 years 9 months ago
Enumerating knight's tours using an ant colony algorithm
In this paper we show how an ant colony optimisation algorithm may be used to enumerate knight’s tours for variously sized chessboards. We have used the algorithm to enumerate al...
Philip Hingston, Graham Kendall
CIMCA
2005
IEEE
15 years 9 months ago
A New Evolutionary Algorithm for Determining the Optimal Number of Clusters
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
Wei Lu, Issa Traoré
FOCS
2005
IEEE
15 years 9 months ago
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
Jon M. Kleinberg