409 search results - page 67 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
EMMCVPR
2001
Springer
15 years 2 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
—This paper investigates time of arrival estimation via impulse radio ultra-wideband technology. A dense multipath channel is assumed and frequency-selective propagation effects ...
NIPS
2008
14 years 11 months ago
2008
In partially observable worlds with many agents, nested beliefs are formed when agents simultaneously reason about the unknown state of the world and the beliefs of the other agen...
164
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...