Most retrieval models estimate the relevance of each document to a query and rank the documents accordingly. However, such an approach ignores the uncertainty associated with the ...
Jianhan Zhu, Jun Wang, Ingemar J. Cox, Michael J. ...
The Montgomery multiplication is often used for an efficient implementations of public-key cryptosystems. This algorithm occasionally needs an extra subtraction in the final step,...
The most efficient technique for protecting the using Frobenius algorithms for scalar multiplication on Koblitz curves against the Side Channel Attacks seems to be the multiplier ...
This paper is a survey of location-routing: a relatively new branch of locational analysis that takes into account vehicle routing aspects. We propose a classification scheme and...
Abstract-- We address the problem of batching messages generated at nodes of a sensor network for the purpose of reducing communication energy at the expense of added latency. We f...