275 search results - page 7 / 55 » Component factors with large components in graphs |
144
click to vote
WOSP
1998
ACM
15 years 3 months ago
1998
ACM
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
87
Voted
PVLDB
2010
14 years 10 months ago
2010
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
103
click to vote
IWOCA
2009
Springer
15 years 4 months ago
2009
Springer
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...
109
click to vote
TKDE
2011
14 years 6 months ago
2011
—Previous studies have demonstrated that document clustering performance can be improved significantly in lower dimensional linear subspaces. Recently, matrix factorization base...
CORR
2012
Springer
13 years 7 months ago
2012
Springer
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...