154 search results - page 7 / 31 » On Boosting with Polynomially Bounded Distributions |
SODA
2003
ACM
13 years 11 months ago
2003
ACM
In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1, . . . , xn) is identically zero, in time polynomial in m, n, log(d + ...
TCS
2008
13 years 9 months ago
2008
Formalized study of self-assembly has led to the definition of the tile assembly model, Previously I presented ways to compute arithmetic functions, such as addition and multiplic...
ESA
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
COCO
2006
Springer
14 years 1 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...