478 search results - page 71 / 96 » Improving probability bounds by optimization over subsets |
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we introduce robust cyclic space– frequency (CSF) filtering for systems combining bit–interleaved coded modulation (BICM) and orthogonal frequency division ...
COMPGEOM
1993
ACM
13 years 11 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
SPAA
2010
ACM
14 years 12 days ago
2010
ACM
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
TKDE
1998
13 years 7 months ago
1998
—We investigate methods to improve the performance of algorithms for automatic storage reclamation of object databases. These algorithms are based on a technique called partition...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...