3415 search results - page 87 / 683 » Lower Bounds for Kernelizations |
83
Voted
CPM
2008
Springer
15 years 2 months ago
2008
Springer
80
Voted
EUROCRYPT
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. A secure failure-localization path-quality-monitoring (FLPQM) protocols allows a sender to localize faulty links on a single path through a network to a receiver, even wh...
ALT
2010
Springer
15 years 2 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
101
click to vote
ALT
2010
Springer
15 years 2 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
77
Voted
APPROX
2010
Springer
15 years 2 months ago
2010
Springer