Abstract. In this paper we provide explicit formulæ to compute bilinear pairings in compressed form. We indicate families of curves where the proposed compressed computation metho...
Michael Naehrig, Paulo S. L. M. Barreto, Peter Sch...
Abstract— We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the...
Abstract— Scalable network localization is key for realizing ad-hoc networks. In this paper we propose a localization scheme where nodes form a relative coordinate system of the ...
Jayasri Akella, Murat Yuksel, Shivkumar Kalyanaram...
Abstract: An original technique to transform functional representation of the design into a structural representation in form of a data flow graph (DFG) is described. A canonical,...
Maciej J. Ciesielski, Serkan Askar, Daniel Gomez-P...
Abstract—This paper considers a broadband cellular orthogonal frequency-division multiple-access (OFDMA) system with relay nodes operating in decode-and-forward and half-duplex m...