Login / Signup

-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time.

Glencora BorradailePiotr SankowskiChristian Wulff-Nilsen
Published in: ACM Trans. Algorithms (2015)
Keyphrases
  • planar graphs
  • preprocessing
  • minimum weight
  • post processing
  • approximate inference
  • feature extraction
  • input image
  • higher order
  • partition function