6142 search results - page 219 / 1229 » The Complexity of Partition Functions |
133
click to vote
ICIP
2001
IEEE
16 years 5 months ago
2001
IEEE
This paper introduces multi-scale tree-based approaches to image segmentation, using Rissanen's coding theoretic minimum description length (MDL) principle to penalize overly...
125
click to vote
PODS
2008
ACM
16 years 3 months ago
2008
ACM
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
111
click to vote
FUN
2007
Springer
15 years 10 months ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
137
click to vote
GMP
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, we propose to combine Kazhdan’s FFT-based approach to surface reconstruction from oriented points with adaptive subdivision and partition of unity blending techni...
110
click to vote
3DIM
2001
IEEE
15 years 7 months ago
2001
IEEE
Analysis and reconstruction of range images usually focuses on complex objects completely contained in the field of view; little attention has been devoted so far to the reconstru...