554 search results - page 90 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
115
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
In this paper, we propose a novel framework for contour based object detection. Compared to previous work, our contribution is three-fold. 1) A novel shape matching scheme suitabl...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a novel structure learning method, Max Margin AND/OR Graph (MM-AOG), for parsing the human body into parts and recovering their poses. Our method represents the human b...
TCS
2008
14 years 11 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
155
click to vote
PODC
2011
ACM
14 years 2 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
114
click to vote
IM
2007
14 years 11 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...