1576 search results - page 173 / 316 » Properties of Synthetic Optimization Problems |
136
click to vote
IPSN
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
152
click to vote
MIRAGE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper we take a fresh look at the problem of extracting shape from contours of human faces. We focus on two key questions: how can we robustly fit a 3D face mode...
122
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
153
click to vote
SYNASC
2005
IEEE
15 years 10 months ago
2005
IEEE
The aim of this work is to analyze the applicability of crowding differential evolution to unsupervised clustering. The basic idea of this approach, interpreting the clustering pr...
156
click to vote
DMSN
2004
ACM
15 years 10 months ago
2004
ACM
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...