5210 search results - page 59 / 1042 » Exact geometric computation |
79
Voted
JSC
2006
15 years 20 days ago
2006
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
69
Voted
CVPR
2000
IEEE
16 years 2 months ago
2000
IEEE
39
Voted
ICPR
2000
IEEE
16 years 1 months ago
2000
IEEE
76
Voted
CONCUR
2010
Springer
15 years 1 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...
99
Voted
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...