477 search results - page 27 / 96 » Complexity Considerations, cSAT Problem Lower Bound |
COLT
2008
Springer
13 years 10 months ago
2008
Springer
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
LATA
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
LOGCOM
2010
13 years 7 months ago
2010
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
ESA
2004
Springer
14 years 2 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
ICASSP
2011
IEEE
13 years 15 days ago
2011
IEEE
The paper contains comparisons of lower bound (potential) and achieved efficiency for filtering grayscale and color images corrupted by AWGN. It is demonstrated that for complex s...