2137 search results - page 173 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
185
click to vote
JMLR
2010
15 years 1 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
167
click to vote
INFOCOM
2008
IEEE
16 years 23 days ago
2008
IEEE
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...
153
click to vote
DCC
2003
IEEE
16 years 6 months ago
2003
IEEE
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix...
185
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
218
click to vote
SWAT
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...