Sciweavers

2766 search results - page 36 / 554
» Algorithms for trigonometric polynomials
Sort
View
FAC
2008
100views more  FAC 2008»
15 years 6 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
CPM
2004
Springer
120views Combinatorics» more  CPM 2004»
15 years 11 months ago
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
COCOON
2006
Springer
15 years 9 months ago
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
Marc Benkert, Joachim Gudmundsson, Christian Knaue...
ISSAC
2005
Springer
81views Mathematics» more  ISSAC 2005»
15 years 11 months ago
Fast algorithms for polynomial solutions of linear differential equations
Alin Bostan, Thomas Cluzeau, Bruno Salvy