2600 search results - page 22 / 520 » Clustering with or without the Approximation |
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
The Dirichlet compound multinomial (DCM) distribution, also called the multivariate Polya distribution, is a model for text documents that takes into account burstiness: the fact ...
RTCSA
2003
IEEE
14 years 29 days ago
2003
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
ICTAI
2008
IEEE
14 years 2 months ago
2008
IEEE
We consider a variation of the problem of combining expert opinions for the situation in which there is no ground truth to use for training. Even though we don’t have labeled da...
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...