1380 search results - page 219 / 276 » A General Polynomial Sieve |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
CORR
2008
Springer
13 years 8 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...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
DATAMINE
2010
13 years 8 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...
ECCC
2010
13 years 8 months ago
2010
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...