1731 search results - page 75 / 347 » Maximum likelihood analysis of algorithms and data structure... |
144
click to vote
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
134
click to vote
TIP
2010
14 years 10 months ago
2010
Abstract--Image segmentation plays an important role in computer vision and image analysis. In this paper, image segmentation is formulated as a labeling problem under a probabilit...
141
click to vote
ISVC
2007
Springer
15 years 10 months ago
2007
Springer
Optical motion capture can be classified as an inference problem: given the data produced by a set of cameras, the aim is to extract the hidden state, which in this case encodes t...
127
Voted
ITSL
2008
15 years 5 months ago
2008
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
118
Voted
VG
2003
15 years 5 months ago
2003
We present new implementations of the Maximum Likelihood Expectation Maximization (EM) algorithm and the related Ordered Subset EM (OSEM) algorithm. Our implementation is based on...