243 search results - page 26 / 49 » On Balanced Graphs |
107
click to vote
PPOPP
2010
ACM
15 years 7 months ago
2010
ACM
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...
84
Voted
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
96
Voted
MM
2010
ACM
14 years 10 months ago
2010
ACM
The major scientific problem for content-based video retrieval is the semantic gap. Generally speaking, there are two appropriate ways to bridge the semantic gap: the first one is...