3415 search results - page 231 / 683 » Lower bounds on kernelization |
173
click to vote
COMPGEOM
2004
ACM
16 years 2 days ago
2004
ACM
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
175
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
182
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
145
click to vote
ALENEX
2007
15 years 8 months ago
2007
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
144
click to vote
ICONIP
2004
15 years 8 months ago
2004
Abstract. Mutual Information (MI) is a long studied measure of coding efficiency, and many attempts to apply it to population coding have been made. However, this is a computationa...