2251 search results - page 30 / 451 » Geometric Algorithms on CUDA |
121
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this...
127
Voted
IMA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis al...
98
Voted
CONCUR
2010
Springer
15 years 4 months ago
2010
Springer
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
117
click to vote
IJCGA
2006
15 years 3 months ago
2006
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
91
Voted
WAOA
2007
Springer
15 years 9 months ago
2007
Springer
