256 search results - page 23 / 52 » Approximation Algorithms for Hamming Clustering Problems |
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
WWW
2010
ACM
15 years 4 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Artificial neural networks (ANNs) have been successfully applied to solve a variety of classification and function approximation problems. Although ANNs can generally predict bett...
COMPGEOM
2000
ACM
15 years 2 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
IEEECIT
2009
IEEE
15 years 4 months ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...