4110 search results - page 254 / 822 » Efficient algorithms for the 2-gathering problem |
164
click to vote
JACM
1998
15 years 6 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
188
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Volume intersection is a frequently used technique to solve the Shape-From-Silhouette problem, which constructs a 3D object estimate from a set of silhouettes taken with calibrate...
184
click to vote
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
In this paper we propose a compressed-domain image enhancement algorithm based on color appearance modeling. We aim at providing an efficient high-quality JPEG color image enhancem...
173
click to vote
IMECS
2007
15 years 8 months ago
2007
—This paper presents a new metamodel-assisted metaheuristic algorithm for optimisation problems involving computationally expensive simulations. The algorithm, called Global Prob...
194
click to vote
WCNC
2008
IEEE
16 years 29 days ago
2008
IEEE
—In this paper, a wireless cognitive radio sensor network is considered, where each sensor node is equipped with cognitive radio and the network is a multi-carrier system operati...