400 search results - page 38 / 80 » Extended formulations in combinatorial optimization |
JCDCG
2004
Springer
15 years 5 months ago
2004
Springer
We prove that all single-vertex origami shapes are reachable from the open flat state via simple, non-crossing motions. We also consider conical paper, where the total sum of the ...
TCS
2010
14 years 10 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
SECON
2008
IEEE
15 years 6 months ago
2008
IEEE
— We address the problem of congestion control in multi-radio, multi-channel, wireless mesh networks. Compared to its single radio counterpart for which solutions exist, this pro...
100
click to vote
MICCAI
2007
Springer
16 years 21 days ago
2007
Springer
Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a p...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— Space Division Multiple Access (SDMA) is a promising solution to improve the spectral efficiency of future mobile radio systems. However, finding the group of MSs tha...