1092 search results - page 143 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
156
click to vote
KI
2006
Springer
15 years 6 months ago
2006
Springer
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...
175
click to vote
PC
2000
15 years 6 months ago
2000
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
191
click to vote
EMNLP
2009
15 years 4 months ago
2009
Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In t...
141
click to vote
ICMLA
2008
15 years 7 months ago
2008
When using machine learning for in silico modeling, the goal is normally to obtain highly accurate predictive models. Often, however, models should also bring insights into intere...
180
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...