1951 search results - page 207 / 391 » An algorithm for improving graph partitions |
129
Voted
CLEIEJ
2008
15 years 5 months ago
2008
Documents in HTML format have many features to analyze, from the terms in special sections to the phrases that appear in the whole document. However, it is important to decide whi...
183
click to vote
CORR
2011
Springer
15 years 18 days ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
143
click to vote
DAC
2004
ACM
15 years 11 months ago
2004
ACM
In order to improve the testabilities and power consumption, a new state assignment technique based on m-block partition is introduced in this paper. The length and number of feed...
183
click to vote
FOCS
1995
IEEE
15 years 9 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
148
click to vote
ICCV
2007
IEEE
16 years 7 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...