6562 search results - page 28 / 1313 » Noetherianity and Combination Problems |
99
Voted
ECCV
2006
Springer
16 years 2 months ago
2006
Springer
Bottom-up segmentation based only on low-level cues is a notoriously difficult problem. This difficulty has lead to recent top-down segmentation algorithms that are based on class-...
113
click to vote
MKM
2009
Springer
15 years 7 months ago
2009
Springer
Methods for deciding quantifier-free non-linear arithmetical conjectures over R are crucial in the formal verification of many realworld systems and in formalised mathematics. Wh...
87
Voted
JCT
2008
15 years 19 days ago
2008
The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negati...
135
Voted
ICIP
2000
IEEE
16 years 1 months ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
92
Voted
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...