1998 search results - page 164 / 400 » Complexity of the Cover Polynomial |
157
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
189
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
212
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombinat...
192
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
165
click to vote
IJCNN
2008
IEEE
16 years 28 days ago
2008
IEEE
—Modeling of complex phenomena such as the mind presents tremendous computational complexity challenges. The neural modeling fields theory (NMF) addresses these challenges in a n...