1161 search results - page 45 / 233 » Approximation schemes for clustering problems |
HIPC
2003
Springer
15 years 2 months ago
2003
Springer
1 Since I/O-intensive tasks running on a heterogeneous cluster need a highly effective usage of global I/O resources, previous CPUor memory-centric load balancing schemes suffer ...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
JMLR
2010
14 years 4 months ago
2010
We consider the problem of correcting the posterior marginal approximations computed by expectation propagation and Laplace approximation in latent Gaussian models and propose cor...
ICIP
2004
IEEE
15 years 11 months ago
2004
IEEE
Motion segmentation is a classic and on-going research topic which is an important pre-stage for many video processes. The reliability of the motion field calculation directly dete...
97
Voted
KDD
2000
ACM
15 years 1 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...