474 search results - page 35 / 95 » Approximation Algorithms for Tensor Clustering |
WWW
2010
ACM
14 years 2 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...
IEEECIT
2009
IEEE
14 years 2 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. ...
ICASSP
2011
IEEE
13 years 5 months ago
2011
IEEE
The scope of the well-known k-means algorithm has been
broadly extended with some recent results: first, the k-
means++ initialization method gives some approximation
guarantees...
ACID
2006
13 years 9 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
VISSYM
2003
13 years 9 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...