Sciweavers

903 search results - page 18 / 181
» On the reduction of a random basis
Sort
View
108
Voted
ICIP
2008
IEEE
16 years 3 months ago
On the estimation of geodesic paths on sampled manifolds under random projections
In this paper, we focus on the use of random projections as a dimensionality reduction tool for sampled manifolds in highdimensional Euclidean spaces. We show that geodesic paths ...
Mona Mahmoudi, Pierre Vandergheynst, Matteo Sorci
DCC
2003
IEEE
16 years 1 months ago
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
Phong Q. Nguyen, Igor Shparlinski
ISSAC
2007
Springer
153views Mathematics» more  ISSAC 2007»
15 years 8 months ago
On exact and approximate interpolation of sparse rational functions
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
Erich Kaltofen, Zhengfeng Yang
121
Voted
DAGSTUHL
2007
15 years 3 months ago
QUAD: Overview and Recent Developments
We give an outline of the specification and provable security features of the QUAD stream cipher proposed at Eurocrypt 2006 [6]. The cipher relies on the iteration of a multivaria...
David Arditti, Côme Berbain, Olivier Billet,...
ICMLA
2007
15 years 3 months ago
Scalable optimal linear representation for face and object recognition
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
Yiming Wu, Xiuwen Liu, Washington Mio