843 search results - page 32 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
AI
2011
Springer
13 years 2 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
IPL
1998
13 years 7 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
ADHOC
2010
13 years 7 months ago
2010
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— Accurate localization of landmarks in the vicinity of a robot is a first step towards solving the SLAM problem. In this work, we propose algorithms to accurately estimate the ...