607 search results - page 1 / 122 » Unifying Exact Completions |
JUCS
2006
13 years 10 months ago
2006
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
EACL
2006
ACL Anthology
14 years 7 days ago
2006
ACL Anthology
We place synchronous tree-adjoining grammars and tree transducers in the single overarching framework of bimorphisms, continuing the unification of synchronous grammars and tree t...
ESA
2007
Springer
14 years 2 months ago
2007
Springer
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...
BMCBI
2008
13 years 11 months ago
2008
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...