Sciweavers

2766 search results - page 110 / 554
» Algorithms for trigonometric polynomials
Sort
View
SIAMDM
2010
99views more  SIAMDM 2010»
14 years 10 months ago
On the Stable Paths Problem
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
ISSAC
2009
Springer
155views Mathematics» more  ISSAC 2009»
15 years 10 months ago
Parallel sparse polynomial multiplication using heaps
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...
Michael B. Monagan, Roman Pearce
121
Voted
TCS
2008
15 years 3 months ago
Real algebraic numbers and polynomial systems of small degree
We present exact and complete algorithms based on precomputed Sturm-Habicht sequences, discriminants and invariants, that classify, isolate with rational points and compare the re...
Ioannis Z. Emiris, Elias P. Tsigaridas
EUROCRYPT
2011
Springer
14 years 7 months ago
Homomorphic Signatures for Polynomial Functions
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
Dan Boneh, David Mandell Freeman
ICPR
2000
IEEE
16 years 4 months ago
Robust Fitting of Implicit Polynomials with Quantized Coefficients to 2D Data
This work presents a new approach to contour representation and coding. It consists of an improved fitting of high-degree (4th to 18th ) implicit polynomials (IPs) to the contour,...
Amir Helzer, Meir Barzohar, David Malah