6142 search results - page 159 / 1229 » The Complexity of Partition Functions |
123
click to vote
CIE
2008
Springer
15 years 5 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
120
click to vote
ICDM
2003
IEEE
15 years 8 months ago
2003
IEEE
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
104
Voted
UAI
2004
15 years 4 months ago
2004
Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual paramete...
149
click to vote
PR
2006
15 years 3 months ago
2006
Clustering for the analysis of the genes organizes the patterns into groups by the similarity of the dataset and has been used for identifying the functions of the genes in the cl...
134
click to vote
JMIV
2007
15 years 3 months ago
2007
Abstract. This paper discusses the interest of the Tree of Shapes of an image as a region oriented image representation. The Tree of Shapes offers a compact and structured represen...