Sciweavers

152 search results - page 19 / 31
» Robust Polynomials and Quantum Algorithms
Sort
View
ASWEC
2004
IEEE
14 years 6 days ago
ASPIRE: Automated Systematic Protocol Implementation Robustness Evaluation
Network protocol implementations are susceptible to problems caused by their lack of ability to handle invalid inputs. We present ASPIRE: Automated Systematic Protocol Implementat...
Arunchandar Vasan, Atif M. Memon
CAD
2006
Springer
13 years 8 months ago
Trimming local and global self-intersections in offset curves/surfaces using distance maps
A robust and efficient algorithm for trimming both local and global self-intersections in offset curves and surfaces is presented. Our scheme is based on the derivation of a ratio...
Joon-Kyung Seong, Gershon Elber, Myung-Soo Kim
COLT
2010
Springer
13 years 6 months ago
Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
Adi Akavia
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
13 years 9 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
COMPGEOM
1997
ACM
14 years 19 days ago
Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
Hervé Brönnimann, Ioannis Z. Emiris, V...