The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Whilst mobile work is increasingly prevalent, there is little detailed study of this phenomenon in the specific context of a train. Thus, the current study focuses on how mobile w...
— A heuristic search for stable high-order delta sigma modulators is presented. Searches guided by the Linear Model found stable modulators with higher SNR performance compared t...
We present the first polynomial time algorithm that finds the shortest route in a simple polygon such that all points of the polygon are visible from the route. This route is cal...
This paper investigates the task of identifying frequently-used pathways from video sequences of natural outdoor scenes. Path models are adaptively learnt from the accumulation of...