Sciweavers

2766 search results - page 284 / 554
» Algorithms for trigonometric polynomials
Sort
View
165
Voted
CAGD
2008
99views more  CAGD 2008»
15 years 5 months ago
Topology and arrangement computation of semi-algebraic planar curves
We describe a new subdivision method to efficiently compute the topology and the arrangement of implicit planar curves. We emphasize that the output topology and arrangement are g...
Lionel Alberti, Bernard Mourrain, Julien Wintz
131
Voted
IJHPCA
2006
125views more  IJHPCA 2006»
15 years 5 months ago
Complexity Results for Collective Communications on Heterogeneous Platforms
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
Olivier Beaumont, Loris Marchal, Yves Robert
DAM
2007
120views more  DAM 2007»
15 years 5 months ago
Advances on sorting by reversals
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
Eric Tannier, Anne Bergeron, Marie-France Sagot
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
15 years 4 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
140
Voted
SAGT
2010
Springer
167views Game Theory» more  SAGT 2010»
15 years 3 months ago
A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for It
Recent results showing PPAD-completeness of the problem of computing an equilibrium for Fisher’s market model under additively separable, piecewise-linear, concave utilities (pl...
Gagan Goel, Vijay V. Vazirani