Sciweavers

279 search results - page 13 / 56
» Matching Polynomials And Duality
Sort
View
JOC
2010
96views more  JOC 2010»
13 years 2 months ago
On the Efficient Generation of Prime-Order Elliptic Curves
We consider the generation of prime-order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
Elisavet Konstantinou, Aristides Kontogeorgis, Yan...
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
13 years 12 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson
ICCV
2009
IEEE
15 years 17 days ago
An Algebraic Approach to Affine Registration of Point Sets
This paper proposes a new affine registration algorithm for matching two point sets in IR2 or IR3. The input point sets are represented as probability density functions, using e...
Jeffrey Ho, Adrian Peter, Anand Rangarajan, Ming-H...
MUE
2007
IEEE
104views Multimedia» more  MUE 2007»
14 years 1 months ago
A Conference Key Distribution Scheme Using Interpolating Polynomials
Conference keys are secret keys used by a group of users commonly and with which they can encipher (or decipher) messages such that communications are secure. Based on the Diffie ...
Chin-Chen Chang, Chu-Hsing Lin, Chien-Yuan Chen
SIAMDM
2010
99views more  SIAMDM 2010»
13 years 2 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