1383 search results - page 124 / 277 » On the Complexity of the Interlace Polynomial |
155
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 ...
187
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...
211
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...
164
click to vote
IJCNN
2008
IEEE
16 years 26 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...
201
click to vote
WINE
2005
Springer
15 years 12 months ago
2005
Springer
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...