961 search results - page 151 / 193 » Significance-Driven Graph Clustering |
152
click to vote
COMSWARE
2006
IEEE
15 years 10 months ago
2006
IEEE
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...
162
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
168
click to vote
NIPS
2004
15 years 5 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
145
click to vote
WWW
2010
ACM
15 years 11 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...
225
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: In recent years, an extensive characterization of network structures has been made in an effort to elucidate design principles of metabolic networks, providing valuabl...