5210 search results - page 313 / 1042 » Exact geometric computation |
179
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
151
Voted
IVC
2007
15 years 6 months ago
2007
This paper tackles the problem of the computation of a planar polygonal curve from a digital planar curve, such that the digital data can be exactly retrieved from the polygonal c...
138
click to vote
JSC
2007
15 years 6 months ago
2007
Triangular decompositions for systems of polynomial equations with n variables, with exact coefficients, are well developed theoretically and in terms of implemented algorithms i...
190
click to vote
ACL
2010
15 years 4 months ago
2010
The Viterbi algorithm is the conventional decoding algorithm most widely adopted for sequence labeling. Viterbi decoding is, however, prohibitively slow when the label set is larg...
146
click to vote
ACL
2009
15 years 4 months ago
2009
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...