3415 search results - page 59 / 683 » Lower Bounds for Kernelizations |
APPROX
2010
Springer
15 years 2 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...
123
Voted
ADHOCNOW
2008
Springer
15 years 1 months ago
2008
Springer
In this paper, we consider the effects on network capacity when the nodes of an ad hoc network are allowed to cooperate. These results are then compared to the theoretical upper b...
97
Voted
COMBINATORICS
1999
15 years 10 days ago
1999
In this article we use two different methods to find new lower bounds for some multicolored Ramsey numbers. In the first part we use the finite field method used by Greenwood and ...
91
Voted
PAMI
1998
15 years 10 days ago
1998
—Deformable template representations of observed imagery, model the variability of target pose via the actions of the matrix Lie groups on rigid templates. In this paper, we stud...
137
Voted
STOC
2012
ACM
13 years 3 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...