2095 search results - page 356 / 419 » Improved pebbling bounds |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
DATAMINE
2010
13 years 10 months ago
2010
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
DC
2010
13 years 10 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
DM
2010
13 years 10 months ago
2010
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...
DM
2008
13 years 10 months ago
2008
Motivated from an application to DNA library screening, Balding and Torney [1] and Colbourn [4] studied the following group testing for consecutive positives. Suppose Vn = {v1 v2 ...