4114 search results - page 178 / 823 » Efficient Algorithms for the 2-Center Problems |
166
click to vote
DAC
1998
ACM
15 years 10 months ago
1998
ACM
Boolean division, and hence Boolean substitution, produces better result than algebraic division and substitution. However, due to the lack of an efficient Boolean division algorit...
162
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 ...
183
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...
151
click to vote
AAAI
1998
15 years 7 months ago
1998
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
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...