7015 search results - page 1322 / 1403 » Approximation algorithms for co-clustering |
KDD
2003
ACM
14 years 9 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
KDD
2001
ACM
14 years 9 months ago
2001
ACM
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
POPL
2005
ACM
14 years 9 months ago
2005
ACM
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...