5 search results - page 1 / 1 » All-Pairs Min-Cut in Sparse Networks |
FSTTCS
1995
Springer
13 years 11 months ago
1995
Springer
SIAMCOMP
1998
13 years 7 months ago
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
WEBI
2009
Springer
14 years 1 months ago
2009
Springer
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
JMLR
2010
13 years 5 months ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...