2430 search results - page 94 / 486 » Computing Tutte Polynomials |
139
click to vote
COCOON
2007
Springer
15 years 11 months ago
2007
Springer
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...
141
click to vote
SIGIR
2004
ACM
15 years 10 months ago
2004
ACM
Latent Semantic Indexing (LSI) is a well established and effective framework for conceptual information retrieval. In traditional implementations of LSI the semantic structure of...
113
click to vote
WCE
2007
15 years 6 months ago
2007
— A form of Gauss-Quadrature rule over [0,1] has been investigated that involves the derivative of the integrand at the pre-assigned left or right end node. This situation arises...
130
click to vote
TSP
2008
15 years 5 months ago
2008
In this correspondence, parameter estimation of a polynomial phase signal (PPS) in additive white Gaussian noise is addressed. Assuming that the order of the PPS is at least 3, the...
139
click to vote
ML
2002
ACM
15 years 4 months ago
2002
ACM
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...