4009 search results - page 423 / 802 » Clustering on Complex Graphs |
178
click to vote
WALCOM
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
194
click to vote
ISPASS
2009
IEEE
16 years 1 months ago
2009
IEEE
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
212
click to vote
IPPS
2006
IEEE
16 years 26 days ago
2006
IEEE
The following three questions should be answered in developing new topology with more powerful ability to tolerate node-failure in wireless sensor network. First, what is node-fai...
194
click to vote
ICITA
2005
IEEE
16 years 13 days ago
2005
IEEE
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...
192
click to vote
ISCC
2005
IEEE
16 years 12 days ago
2005
IEEE
The use of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-toPeer (P2P) Networks. In this paper, we study the performance of Yao-G...