Sign in

Finding a Dense Subgraph with Sparse Cut.

Atsushi MiyauchiNaonori Kakimura
Published in: CIKM (2018)
Keyphrases
  • high dimensional
  • dense optical flow
  • dense stereo
  • real time
  • computer vision
  • clustering algorithm
  • lower bound
  • graph mining