395 search results - page 22 / 79 » Positive Versions of Polynomial Time |
158
click to vote
ALGORITHMICA
1998
15 years 5 months ago
1998
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
144
click to vote
JSAT
2010
15 years 20 days ago
2010
This paper is devoted to investigate resolution for quantified generalized clause-sets (QCLS). The soundness and refutation completeness are proved. Then quantified generalized Ho...
142
click to vote
ICIP
2003
IEEE
16 years 7 months ago
2003
IEEE
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...
167
click to vote
GOSLER
1995
15 years 9 months ago
1995
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...
149
click to vote
CC
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...