1951 search results - page 325 / 391 » An algorithm for improving graph partitions |
122
click to vote
FOCS
1997
IEEE
15 years 2 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
AAAI
1998
14 years 11 months ago
1998
We describe a general approach to optimization which we term Squeaky Wheel" Optimization SWO. In SWO, a greedy algorithm is used to construct a solution which is then analyze...
80
Voted
CASCON
1996
14 years 11 months ago
1996
This paper1 describes an algorithm for testing polymorphic interactions between classes in object-oriented (O-O) software. We propose an Augmented Object Relationship Diagram (AOR...
91
Voted
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
121
click to vote
KDD
2012
ACM
13 years 19 days ago
2012
ACM
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...