Sciweavers

27 search results - page 4 / 6
» Arbitrary Precision Arithmetic - SIMD Style
Sort
View
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
13 years 11 months ago
Certifying and repairing solutions to large LPs how good are LP-solvers?
State-of-the-art linear programming (LP) solvers give solutions without any warranty. Solutions are not guaranteed to be optimal or even close to optimal. Of course, it is general...
Marcel Dhiflaoui, Stefan Funke, Carsten Kwappik, K...
VC
2008
102views more  VC 2008»
13 years 9 months ago
Solving nonlinear polynomial systems in the barycentric Bernstein basis
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...
Martin Reuter, Tarjei S. Mikkelsen, Evan C. Sherbr...
IEEEARES
2008
IEEE
14 years 4 months ago
A Lightweight Security Analyzer inside GCC
This paper describes the design and implementation of a lightweight static security analyzer that exploits the compilation process of the gcc compiler. The tool is aimed at giving...
Davide Pozza, Riccardo Sisto
ISVC
2009
Springer
14 years 4 months ago
Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
Given a Cylindrical Algebraic Decomposition of an implicit algebraic curve, visualizing distinct curve arcs is not as easy as it stands because, despite the absence of singularitie...
Pavel Emeliyanenko, Eric Berberich, Michael Sagral...
CGF
2010
146views more  CGF 2010»
13 years 10 months ago
Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes
We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Mink...
Marcel Campen, Leif Kobbelt