Sciweavers

471 search results - page 31 / 95
» Faster Multiplication in GF(2)[x]
Sort
View
FGCS
2010
76views more  FGCS 2010»
13 years 8 months ago
Self-healing network for scalable fault-tolerant runtime environments
Scalable and fault tolerant runtime environments are needed to support and adapt to the underlying libraries and hardware which require a high degree of scalability in dynamic larg...
Thara Angskun, Graham E. Fagg, George Bosilca, Jel...
FLAIRS
2009
13 years 7 months ago
Join Tree Propagation Utilizing Both Arc Reversal and Variable Elimination
In this paper, we put forth the first join tree propagation algorithm that selectively applies either arc reversal (AR) or variable elimination (VE) to build the propagated messag...
Cory J. Butz, Ken Konkel, Pawan Lingras
SIAMNUM
2010
103views more  SIAMNUM 2010»
13 years 4 months ago
Hybridization and Postprocessing Techniques for Mixed Eigenfunctions
Abstract. We introduce hybridization and postprocessing techniques for the RaviartThomas approximation of second-order elliptic eigenvalue problems. Hybridization reduces the Ravia...
Bernardo Cockburn, Jayadeep Gopalakrishnan, F. Li,...
TIT
2011
152views more  TIT 2011»
13 years 4 months ago
Fast Exponentiation Using Split Exponents
Abstract—We propose a new method to speed up discrete logarithm (DL)-based cryptosystems by considering a new variant of the DL problem, where the exponents are formed as e1 + α...
Jung Hee Cheon, Stanislaw Jarecki, Taekyoung Kwon,...
ICASSP
2011
IEEE
13 years 1 months ago
Fast algorithm for beamforming problems in distributed communication of relay networks
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
Cong Sun, Yaxiang Yuan