A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edge...
The hyperelliptic curve cryptosystems take most of the time for computing a scalar multiplication kD of an element D in the Jacobian JC of a hyperelliptic curve C for an integer k....
This paper presents an analytical model of TCP Reno throughput as a function of loss event rate, average round trip time, average retransmission timeout value, and receiver window...
Anonymity is a desirable security feature in addition to providing user identification and key agreement during a user's login process. Recently, Yang et al., proposed an eff...
Quantile smoothing splines provide nonparametric estimation of conditional quantile functions. Like other nonparametric smoothing techniques, the choice of smoothing parameters co...