564 search results - page 65 / 113 » Linear Time Algorithms for Exact Distance Transform |
SWAT
2004
Springer
14 years 3 months ago
2004
Springer
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
SIGIR
2012
ACM
12 years 18 days ago
2012
ACM
Users increasingly rely on their mobile devices to search local entities, typically businesses, while on the go. Even though recent work has recognized that the ranking signals in...
IROS
2009
IEEE
14 years 4 months ago
2009
IEEE
— This paper introduces an approach that reduces the size of the state and maximizes the sparsity of the information matrix in exactly sparse delayed-state SLAM. We propose const...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We propose a new graph representation for ISI channels that can be used for combined equalization and decoding by linear programming (LP) or iterative message-passing (IMP) decodi...
DGCI
2008
Springer
13 years 12 months ago
2008
Springer
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...