5606 search results - page 397 / 1122 » Randomization Techniques for Graphs. |
195
click to vote
VIP
2000
15 years 8 months ago
2000
This paper presents a system for graph clustering where users can visualize the clustering and give "hints" that help a computing method to find better solutions. Hints ...
158
click to vote
ORDER
2008
15 years 6 months ago
2008
We give various constructions of uncountable arc-transitive bipartite graphs employing techniques from partial orders, starting with the cyclefree case, but generalizing to cases ...
180
click to vote
SIGIR
2006
ACM
16 years 19 days ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
195
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
175
click to vote
ISQED
2006
IEEE
16 years 21 days ago
2006
IEEE
This paper proposes a novel method for analyzing large onchip power delivery networks via a stochastic moment matching (SMM) method. The proposed method extends the existing direc...