3415 search results - page 114 / 683 » Lower Bounds for Kernelizations |
131
click to vote
DCG
2006
15 years 4 months ago
2006
We use circular sequences to give an improved lower bound on the minimum number of ( k)
114
click to vote
EJC
2000
15 years 4 months ago
2000
Lower bounds on the size of t-fold blocking sets with respect to hyperplanes or t-intersection sets in AG(n, q) are obtained, some of which are sharp.
147
click to vote
COLT
2004
Springer
15 years 9 months ago
2004
Springer
The main goal of this paper is to prove inequalities on the reconstruction error for Kernel Principal Component Analysis. With respect to previous work on this topic, our contribu...
153
click to vote
CIE
2010
Springer
15 years 9 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
159
click to vote
JCT
2008
15 years 4 months ago
2008
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...