51 search results - page 3 / 11 » How slow is the k-means method |
119
click to vote
ICIP
2004
IEEE
16 years 2 months ago
2004
IEEE
We present methods to obtain computationally efficient proposal distributions for Bayesian reversible jump Markov chain Monte Carlo (RJMCMC) based image segmentation. The slow con...
ISAAC
2001
Springer
15 years 5 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
LREC
2010
15 years 2 months ago
2010
For many languages there are no large, general-language corpora available. Until the web, all but the richest institutions could do little but shake their heads in dismay as corpu...
88
Voted
ICIP
1998
IEEE
15 years 5 months ago
1998
IEEE
In this paper, the problem of how to better estimate spatially adaptive intensity bounds for image restoration is addressed. When the intensity bounds are estimated from a degrade...
86
Voted
APL
1998
ACM
15 years 5 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...