MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Finding k Cuts within Twice the Optimal." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

3 documents found, showing 1 through 3.

ATOM

Finding k-cuts within Twice the Optimal
by Huzur Saran, Vijay V. Vazirani — 1995
…Finding k-cuts within Twice the Optimal Huzur Saran Vijay V. Vazirani Dept. of Computer Science…
Cited by 38 (2 self) – Add To MetaCart

[190] H. Yang and D. F. Wong. Efficient network flow based min-cut balanced partitioning. In
by Proc Ieee, Y. Saab, V. Rao, Fast Ieee, Trans Computeraided
…. Finding k-cuts within twice the optimal. In Proc. IEEE Symp. Foundations of Computer Science, pages 743…
Add To MetaCart

A Quantitative Approach to Perceptual Grouping in Computer Vision
by Arnon Amir, J. Beck, B. Hope, A. Rosenfeld, Machine Vision, A. Zisserman, J. Mundy, D. Forsyth, J. Liu, N. Pillow, C. Rothwell — 1997
… Systems (NIPS) 3, 1990. [SV95] H. Saran and V. V. Vazirani. Finding k-cuts within twice the optimal. SIAM…
Cited by 2 (2 self) – Add To MetaCart

Showing 1 through 3.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB