ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1402.0240
  4. Cited By
Graph Cuts with Interacting Edge Costs - Examples, Approximations, and
  Algorithms
v1v2v3v4 (latest)

Graph Cuts with Interacting Edge Costs - Examples, Approximations, and Algorithms

2 February 2014
Stefanie Jegelka
J. Bilmes
ArXiv (abs)PDFHTML

Papers citing "Graph Cuts with Interacting Edge Costs - Examples, Approximations, and Algorithms"

1 / 1 papers shown
Title
Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral
  Clustering
Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering
Pan Li
O. Milenkovic
77
113
0
10 Mar 2018
1