7978 search results - page 512 / 1596 » Combining shared-coin algorithms |
199
click to vote
VCBM
2010
15 years 1 months ago
2010
Cerebral aneurysms are a vascular dilatation induced by a pathological change of the vessel wall and often require treatment to avoid rupture. Therefore, it is of main interest, t...
203
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
177
click to vote
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
We present a new unsupervised method to learn unified probabilistic object models (POMs) which can be applied to classification, segmentation, and recognition. We formulate this a...
165
click to vote
IPMI
2003
Springer
16 years 7 months ago
2003
Springer
It is well-known in the pattern recognition community that the accuracy of classifications obtained by combining decisions made by independent classifiers can be substantially high...
182
click to vote
ICCV
2009
IEEE
16 years 12 months ago
2009
IEEE
Median-shift is a mode seeking algorithm that relies on
computing the median of local neighborhoods, instead of
the mean. We further combine median-shift with Locality
Sensitive...