3934 search results - page 361 / 787 » A monothetic clustering method |
249
click to vote
GECCO
2009
Springer
16 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
196
click to vote
ICDM
2008
IEEE
16 years 2 months ago
2008
IEEE
We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises t...
214
click to vote
ISBI
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a novel local region approach for statistically characterizing appearance in the context of medical image segmentation via deformable models. Our appearance model refl...
223
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
Recently, the analysis of moving objects has become one of the most important technologies to be used in various applications such as GIS, navigation systems, and locationbased in...
299
click to vote
ICDM
2006
IEEE
16 years 1 months ago
2006
IEEE
In spite of the initialization problem, the ExpectationMaximization (EM) algorithm is widely used for estimating the parameters in several data mining related tasks. Most popular ...