843 search results - page 67 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
197
click to vote
TON
2010
14 years 8 months ago
2010
The Maximum Differential Backlog (MDB) control policy of Tassiulas and Ephremides has been shown to adaptively maximize the stable throughput of multihop wireless networks with ran...
114
click to vote
TIT
2010
14 years 8 months ago
2010
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
142
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
117
click to vote
RECOMB
1997
Springer
15 years 5 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
120
click to vote
ICDE
2009
IEEE
15 years 8 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...