3422 search results - page 291 / 685 » Random Subset Optimization |
146
click to vote
STOC
1998
ACM
15 years 9 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
135
click to vote
APNOMS
2006
Springer
15 years 8 months ago
2006
Springer
In this work we propose an analytic framework for managing the optimal bandwidth required for a smooth playback of a stored video streaming service. First, we argue that the mean b...
156
click to vote
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
—In this paper we present a method for seamless enlargement and editing of intricate near-regular type of bidirectional texture function (BTF) which contains simultaneously both ...
152
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
134
click to vote
MOR
2008
15 years 4 months ago
2008
A framework is set up in which linear regression, as a way of approximating a random variable by other random variables, can be carried out in a variety of ways, which moreover ca...