7930 search results - page 666 / 1586 » Greedy in Approximation Algorithms |
171
click to vote
CPC
2007
15 years 7 months ago
2007
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we hav...
195
click to vote
TCS
2008
15 years 7 months ago
2008
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
192
click to vote
TMI
2008
15 years 5 months ago
2008
We develop an approximate fan-beam algorithm to reconstruct an object with time-dependent nonrigid transformation such as the heart. The method is in the form of derivative backpro...
298
Voted
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
We propose a new family of non-submodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an efï¬...
387
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
âWhen a large amount of sensors are randomly deployed into a ï¬eld, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the ï¬e...