1221 search results - page 142 / 245 » Balanced graph partitioning |
134
Voted
ANOR
2004
15 years 2 months ago
2004
We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which at its most basic ...
118
Voted
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
161
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—Continuous growth in network link rates poses a strong demand on high speed IP lookup engines. While Ternary Content Addressable Memory (TCAM) based solutions serve most of toda...
127
Voted
WOSP
2005
ACM
15 years 8 months ago
2005
ACM
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
169
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...