843 search results - page 69 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
116
Voted
TIP
1998
15 years 1 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
114
click to vote
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...
174
click to vote
SCVMA
2004
Springer
15 years 6 months ago
2004
Springer
3D-model-based tracking offers one possibility to explicate the manner in which spatial coherence can be exploited for the analysis of image sequences. Two seemingly different ap...
136
click to vote
AUTOMATICA
2008
15 years 1 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
125
click to vote
MMS
2000
15 years 1 months ago
2000
An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the Quality of Service (QoS) requirements o...