65 search results - page 3 / 13 » Uniform Derandomization from Pathetic Lower Bounds |
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
113
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
ALT
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
MOC
2000
14 years 11 months ago
2000
The objective of this paper is to introduce a general scheme for deriving a posteriori error estimates by using duality theory of the calculus of variations. We consider variationa...
ISPAN
2005
IEEE
15 years 5 months ago
2005
IEEE
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...