1951 search results - page 297 / 391 » An algorithm for improving graph partitions |
134
click to vote
WWW
2004
ACM
16 years 5 months ago
2004
ACM
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
140
click to vote
ISPASS
2006
IEEE
15 years 10 months ago
2006
IEEE
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...
184
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov C...
100
click to vote
WWW
2001
ACM
16 years 5 months ago
2001
ACM
Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph app...
138
click to vote
ICDCS
2009
IEEE
16 years 1 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...