: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
—High node mobility and transient connectivity in Vehicular Ad Hoc NETworks have introduced numerous challenges in the design of efficient communication protocols for these netwo...
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...