455 search results - page 21 / 91 » A local approximation algorithm for maximum weight matching |
ICIP
2007
IEEE
15 years 7 months ago
2007
IEEE
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
132
click to vote
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
In this paper, we propose a novel framework for contour based object detection. Compared to previous work, our contribution is three-fold. 1) A novel shape matching scheme suitabl...
112
Voted
RECOMB
2010
Springer
14 years 11 months ago
2010
Springer
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
145
click to vote
MOBICOM
2006
ACM
15 years 7 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
107
click to vote
SODA
2001
ACM
15 years 2 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...