136 search results - page 7 / 28 » Experimental Study of Minimum Cut Algorithms |
CCCG
2007
14 years 11 months ago
2007
We introduce bundle-free triangulations, that are free of large collection of triangles overlapping a circle empty of vertices. We prove that bundle-free Steiner triangulations ca...
116
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
CCCG
2006
14 years 11 months ago
2006
We study the following geometric probing problem: Reconstruct a planar polygon from its intersections with a collection of arbitrarily-oriented "cutting" lines. We propo...
TMC
2008
14 years 9 months ago
2008
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...