Sciweavers

2745 search results - page 315 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
ICISC
1998
87views Cryptology» more  ICISC 1998»
15 years 8 months ago
Rabin and RSA analogues based on non-maximal imaginary quadratic orders
Abstract. In 14] and 21] there are proposed ElGamal-type cryptosystems based on non-maximal imaginary quadratic orders with fast trapdoor decryption. The trapdoor information is th...
Detlef Hühnlein, Andreas Meyer, Tsuyoshi Taka...
CVPR
2010
IEEE
15 years 7 months ago
Boosting for transfer learning with multiple sources
Transfer learning allows leveraging the knowledge of source domains, available a priori, to help training a classifier for a target domain, where the available data is scarce. Th...
Yi Yao, Gianfranco Doretto
DAC
2008
ACM
16 years 8 months ago
Stochastic integral equation solver for efficient variation-aware interconnect extraction
In this paper we present an efficient algorithm for extracting the complete statistical distribution of the input impedance of interconnect structures in the presence of a large n...
Tarek Moselhy, Luca Daniel
IPPS
2006
IEEE
16 years 1 months ago
Compiler assisted dynamic management of registers for network processors
Modern network processors support high levels of parallelism in packet processing by supporting multiple threads that execute on a micro-engine. Threads switch context upon encoun...
R. Collins, Fernando Alegre, Xiaotong Zhuang, Sant...
FAST
2008
15 years 9 months ago
Improving I/O Performance of Applications through Compiler-Directed Code Restructuring
Ever-increasing complexity of large-scale applications and continuous increases in sizes of the data they process make the problem of maximizing performance of such applications a...
Mahmut T. Kandemir, Seung Woo Son, Mustafa Karak&o...