628 search results - page 109 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
137
Voted
ICIP
2010
IEEE
2010
IEEE
Restoration of images and 3D data to higher resolution by deconvolution with sparsity regularization
15 years 14 days ago
Image convolution is conventionally approximated by the LTI discrete model. It is well recognized that the higher the sampling rate, the better is the approximation. However somet...
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
We present a novel multi-object tracking algorithm based on multiple hypotheses about the trajectories of the objects. Our work is inspired by Reid's multiple hypothesis trac...
195
click to vote
PODS
2009
ACM
16 years 3 months ago
2009
ACM
A distributed XML document is an XML document that spans several machines or Web repositories. We assume that a distribution design of the document tree is given, providing an XML...
156
click to vote
EOR
2007
15 years 2 months ago
2007
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
133
Voted
TSP
2008
15 years 2 months ago
2008
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...