361 search results - page 29 / 73 » Maximum subset intersection |
120
Voted
JACM
1998
15 years 2 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 ...
131
click to vote
CVPR
2007
IEEE
16 years 4 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...
104
click to vote
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
We present a novel geometrical constraint on the egomotion of a single, moving camera. Using a camera with a large field-of-view (FOV), the optical flow measured at a single pair ...
133
click to vote
SIAMJO
2008
15 years 1 months ago
2008
Let A and B be nonempty, convex and closed subsets of a Hilbert space H. In the practical considerations we need to find an element of the intersection A B or, more general, to s...
92
Voted
WWW
2008
ACM
16 years 3 months ago
2008
ACM
Most current banner advertising is sold through negotiation thereby incurring large transaction costs and possibly suboptimal allocations. We propose a new automated system for se...