608 search results - page 84 / 122 » On Dependent Randomized Rounding Algorithms |
TIT
2002
13 years 7 months ago
2002
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...
VTC
2010
IEEE
13 years 6 months ago
2010
IEEE
—A common simplification in the treatment of random linear channels is the wide-sense stationary and uncorrelated scattering (WSSUS) assumption. For wireless channels, this assu...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...