337 search results - page 41 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
In this paper we propose a framework for gradient descent
image alignment in the Fourier domain. Specifically,
we propose an extension to the classical Lucas & Kanade
(LK) a...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
PAMI
2010
13 years 6 months ago
2010
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
DAC
2006
ACM
14 years 9 months ago
2006
ACM
In this paper, a Triangularization Based Structure preserving (TBS) model order reduction is proposed to verify power integrity of on-chip structured power grid. The power grid is...