Sciweavers

5210 search results - page 59 / 1042
» Exact geometric computation
Sort
View
JSC
2006
132views more  JSC 2006»
14 years 9 months ago
From an approximate to an exact absolute polynomial factorization
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...
Guillaume Chèze, André Galligo
CONCUR
2010
Springer
14 years 11 months ago
A Geometric Approach to the Problem of Unique Decomposition of Processes
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...
Thibaut Balabonski, Emmanuel Haucourt
IWPEC
2009
Springer
15 years 4 months ago
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
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...
Henning Fernau, Joachim Kneis, Dieter Kratsch, Ale...