49 search results - page 7 / 10 » Dynamic Algorithm for Graph Clustering Using Minimum Cut Tre... |
KDD
2009
ACM
14 years 8 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
IJCAI
2007
13 years 9 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
IPPS
2003
IEEE
14 years 28 days ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...