2430 search results - page 118 / 486 » Computing Tutte Polynomials |
111
click to vote
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
We provide the first polynomial time algorithm for the linear version of a market equilibrium model defined by Irving Fisher in 1891, thereby partially answering an open questio...
142
Voted
FCT
2001
Springer
15 years 9 months ago
2001
Springer
We show that some natural refinements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar refinements of the polynom...
118
Voted
SIGGRAPH
1994
ACM
15 years 9 months ago
1994
ACM
An algorithm for creating smooth spline surfaces over irregular meshes is presented. The algorithm is a generalization of quadratic B-splines; that is, if a mesh is (locally) regu...
176
click to vote
COCO
2010
Springer
15 years 9 months ago
2010
Springer
—We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC1 = Log(CFL)) can be accepted by a symm...
116
Voted
ACL
2003
15 years 6 months ago
2003
We augment a model of translation based on re-ordering nodes in syntactic trees in order to allow alignments not conforming to the original tree structure, while keeping computati...