8728 search results - page 140 / 1746 » On Reduct Construction Algorithms |
103
click to vote
GD
2005
Springer
15 years 6 months ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
92
Voted
EUROCRYPT
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. This paper addresses the discrete logarithm problem in elliptic curve cryptography. In particular, we generalize the Menezes, Okamoto, and Vanstone (MOV) reduction so tha...
105
click to vote
ASPDAC
2007
ACM
15 years 5 months ago
2007
ACM
A new graph reduction approach to symbolic circuit analysis is developed in this paper. A Binary Decision Diagram (BDD) mechanism is formulated, together with a specially designed ...
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Most existing approaches for single-channel noise reduction in the frequency domain via the short-time Fourier transform (STFT) assume that consecutive time-frames are uncorrelate...
79
Voted
AUSDM
2007
Springer
15 years 7 months ago
2007
Springer
One of the inherent problems in pattern recognition is the undersampled data problem, also known as the curse of dimensionality reduction. In this paper a new algorithm called pai...