3415 search results - page 123 / 683 » Lower Bounds for Kernelizations |
151
click to vote
ICIP
1995
IEEE
15 years 8 months ago
1995
IEEE
This paper develops an error bound for narrow bandwidth Gabor filters synthesized using multiple stages. It is shown that the error introduced by approximating narrow bandwidth Ga...
103
click to vote
ISIPTA
2003
IEEE
15 years 9 months ago
2003
IEEE
Kuznetsov’s condition says that variables X and Y are independent when any product of bounded functions f(X) and g(Y) behaves in a certain way: the interval of expected values E...
119
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
For fitting an ellipse to a point sequence, ML (maximum likelihood) has been regarded as having the highest accuracy. In this paper, we demonstrate the existence of a "hyperac...
135
click to vote
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
128
click to vote
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
We show that the multi-commodity max-flow/min-cut gap for series-parallel graphs can be as bad as 2, matching a recent upper bound [8] for this class, and resolving one side of a ...