4894 search results - page 872 / 979 » The Guarding Problem - Complexity and Approximation |
CGF
2008
13 years 8 months ago
2008
We present a robust and efficient algorithm for the pairwise non-rigid registration of partially overlapping 3D surfaces. Our approach treats non-rigid registration as an optimiza...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is po...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspecti...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A wireless system with multiple channels is considered, where each channel has several transmission states. A user learns about the instantaneous state of an available channel by ...