1951 search results - page 54 / 391 » An algorithm for improving graph partitions |
152
Voted
NIPS
2008
15 years 5 months ago
2008
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
143
Voted
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
122
Voted
AAAI
1996
15 years 5 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
132
Voted
MOBICOM
2006
ACM
15 years 9 months ago
2006
ACM
This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distrib...
109
Voted
GD
2007
Springer
15 years 10 months ago
2007
Springer
We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced b...