Sciweavers

2766 search results - page 179 / 554
» Algorithms for trigonometric polynomials
Sort
View
DIALM
2008
ACM
139views Algorithms» more  DIALM 2008»
15 years 6 months ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
Zeev Nutov
ALENEX
2004
116views Algorithms» more  ALENEX 2004»
15 years 5 months ago
A Computational Framework for Handling Motion
We present a framework for implementing geometric algorithms involving motion. It is written in C++ and modeled after and makes extensive use of CGAL (Computational Geometry Algor...
Leonidas J. Guibas, Menelaos I. Karavelas, Daniel ...
CC
2010
Springer
135views System Software» more  CC 2010»
15 years 4 months ago
Counting Irreducible Components of Complex Algebraic Varieties
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
Peter Bürgisser, Peter Scheiblechner
COMPGEOM
2007
ACM
15 years 8 months ago
On the hardness of minkowski addition and related operations
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
Hans Raj Tiwary
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
15 years 5 months ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris