371 search results - page 14 / 75 » Algorithms for the transportation problem in geometric setti... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
In this paper we establish a topological similarity between two apparently different shape constructors from a set of points. Shape constructors are geometric structures that tran...
FAW
2008
Springer
13 years 9 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
ICCV
2009
IEEE
15 years 20 days ago
2009
IEEE
Finding correspondences between feature points is one
of the most relevant problems in the whole set of visual
tasks. In this paper we address the problem of matching
a feature ...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...