Sciweavers

65 search results - page 12 / 13
» Fixed Points for Discrete Logarithms
Sort
View
SIAMMAX
2010
116views more  SIAMMAX 2010»
13 years 2 months ago
Structured Total Maximum Likelihood: An Alternative to Structured Total Least Squares
Abstract. Linear inverse problems with uncertain measurement matrices appear in many different applications. One of the standard techniques for solving such problems is the total l...
Amir Beck, Yonina C. Eldar
EUROCRYPT
1999
Springer
13 years 11 months ago
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
Pascal Paillier
ICCV
1999
IEEE
14 years 9 months ago
Differential Matching Constraints
We introduce a finite difference expansion for closely spaced cameras in projective vision, and use it to derive differential analogues of the finite-displacement projective match...
Bill Triggs
SIAMREV
2010
119views more  SIAMREV 2010»
13 years 2 months ago
From Functional Analysis to Iterative Methods
We examine condition numbers, preconditioners, and iterative methods for finite element discretizations of coercive PDEs in the context of the fundamental solvability result, the L...
Robert C. Kirby
COMPGEOM
2010
ACM
14 years 13 days ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan