121 search results - page 20 / 25 » Approximating Maximum Weight Matching in Near-Linear Time |
120
Voted
NIPS
2007
15 years 2 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
113
click to vote
STOC
1990
ACM
15 years 4 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
116
click to vote
ENC
2007
IEEE
15 years 6 months ago
2007
IEEE
This manuscript proposes a retrieval system for fMRI brain images. Our goal is to find a similaritymetric to enable us to support queries for “similar tasks” for retrieval on...
83
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
98
Voted
GLOBECOM
2006
IEEE
15 years 6 months ago
2006
IEEE
Abstract— Virtual Output Queuing is widely used by highspeed packet switches to overcome head-of-line blocking. This is done by means of matching algorithms. In fixed-length VOQ...