Sciweavers

5962 search results - page 38 / 1193
» Efficient Clustering for Orders
Sort
View
ICISC
2004
108views Cryptology» more  ICISC 2004»
15 years 3 months ago
Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
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...
AMAI
2004
Springer
15 years 7 months ago
Using Automatic Case Splits and Efficient CNF Translation to Guide a SAT-solver when Formally Verifying Out-Of-Order Processors
The paper integrates automatically generated case-splitting expressions, and an efficient translation to CNF, in order to formally verify an out-of-order superscalar processor havi...
Miroslav N. Velev
ICCAD
2002
IEEE
175views Hardware» more  ICCAD 2002»
15 years 10 months ago
Efficient model order reduction via multi-node moment matching
- The new concept of Multi-node Moment Matching (MMM) is introduced in this paper. The MMM technique simultaneously matches the moments at several nodes of a circuit using explicit...
Yehea I. Ismail
ICIP
2003
IEEE
16 years 3 months ago
Efficient frame vector selection based on ordered sets
The problem of finding the optimal set of quantized coefficients for a frame-based encoded signal is known to be of very high complexity. This paper presents an efficient method o...
Tom Ryen, Guido M. Schuster, Aggelos K. Katsaggelo...
ALGORITHMICA
2008
121views more  ALGORITHMICA 2008»
15 years 2 months ago
Space Efficient Algorithms for Ordered Tree Comparison
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
Lusheng Wang, Kaizhong Zhang