2137 search results - page 393 / 428 » Experiments on Graph Clustering Algorithms |
125
click to vote
DAC
2006
ACM
16 years 4 months ago
2006
ACM
As the technology node advances into the nanometer era, via-open defects are one of the dominant failures. To improve via yield and reliability, redundant-via insertion is a highl...
137
click to vote
WWW
2004
ACM
16 years 3 months ago
2004
ACM
Web link analysis has proven to be a significant enhancement for quality based web search. Most existing links can be classified into two categories: intra-type links (e.g., web h...
146
click to vote
ICCAD
1999
IEEE
15 years 7 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
125
click to vote
NIPS
2000
15 years 4 months ago
2000
In an important recent paper, Yedidia, Freeman, and Weiss [11] showed that there is a close connection between the belief propagation algorithm for probabilistic inference and the...
133
click to vote
WWW
2011
ACM
14 years 10 months ago
2011
ACM
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...