455 search results - page 23 / 91 » A local approximation algorithm for maximum weight matching |
ISAAC
2004
Springer
15 years 3 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...
CAIP
2009
Springer
15 years 4 months ago
2009
Springer
Color processing imposes a new constraint on stereo vision algorithms: The assumption of constant color on object surfaces used to align local correlation windows with object bound...
88
Voted
ICASSP
2010
IEEE
14 years 9 months ago
2010
IEEE
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
90
Voted
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...
ISPAN
1997
IEEE
15 years 1 months ago
1997
IEEE
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...