Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
In this paper, a new wavelet-domain codebook design algorithm is proposed for image coding. The method utilizes mean-squared error and variance based selection schemes for good cl...
Momotaz Begum, Nurun Nahar, Kaneez Fatimah, M. K. ...
How to price options efficiently and accurately is an important research problem. Options can be priced by the lattice model. Although the pricing results converge to the theoreti...
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...