Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Over the last decade and a half, tabu search algorithms for machine scheduling have gained a near-mythical reputation by consistently equaling or establishing state-of-the-art per...
Jean-Paul Watson, Adele E. Howe, L. Darrell Whitle...
We propose a sequential Monte Carlo data association algorithm based on a two-level computational framework for tracking varying number of interacting objects in dynamic scene. Fi...
— A research topic that is becoming increasingly popular is that of on-board mobile communication, where users on a vehicle are connected to a local network that attaches to the ...
A spatially adaptive image deblurring algorithm is presented for Poisson observations. It adapts to the unknown image smoothness by using local polynomial approximation (LPA) kern...
Alessandro Foi, Sakari Alenius, Mejdi Trimeche, Vl...