545 search results - page 38 / 109 » Simultaneous approximation by greedy algorithms |
124
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
123
click to vote
CVPR
2010
IEEE
16 years 7 days ago
2010
IEEE
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involv...
138
click to vote
MOBIHOC
2009
ACM
16 years 4 months ago
2009
ACM
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh routers in WMNs typically use multiple wireless channel...
140
click to vote
ICIP
2004
IEEE
16 years 5 months ago
2004
IEEE
The dictionary approach to signal and image processing has been massively investigated in the last two decades, proving very attractive for a wide range of applications. The effec...
132
click to vote
SGP
2003
15 years 5 months ago
2003
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...