130 search results - page 3 / 26 » Binary Representations for General CSPs |
TC
2011
13 years 3 months ago
2011
—Single and double scalar multiplications are the most computational intensive operations in elliptic curve based cryptosystems. Improving the performance of these operations is ...
GECCO
2006
Springer
14 years 13 days ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
ICIP
2005
IEEE
14 years 2 months ago
2005
IEEE
Binary Partition Trees (BPTs) are a well known technique used for region-based image representation and analysis. BPTs are usually created as a result of a merging process based o...
CRYPTO
2004
Springer
14 years 2 months ago
2004
Springer
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
VOSS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. This paper describes symbolic techniques for the construction, representation and analysis of large, probabilistic systems. Symbolic approaches derive their efficiency by...