402 search results - page 58 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
127
Voted
SAC
2003
ACM
15 years 5 months ago
2003
ACM
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...
87
Voted
COR
2006
15 years 14 days ago
2006
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...
102
Voted
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
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...
115
click to vote
VTC
2006
IEEE
15 years 6 months ago
2006
IEEE
— 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 ...
81
Voted
ICIP
2005
IEEE
16 years 2 months ago
2005
IEEE
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...