843 search results - page 125 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
WALCOM
2010
IEEE
14 years 2 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...
DAS
2006
Springer
13 years 11 months ago
2006
Springer
Traditional approaches to combining classifiers attempt to improve classification accuracy at the cost of increased processing. They may be viewed as providing an accuracy-speed tr...
AAAI
2007
13 years 9 months ago
2007
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...