3250 search results - page 149 / 650 » An Algorithm to Solve a Linear Program |
177
click to vote
COCOA
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
147
click to vote
CVPR
2008
IEEE
16 years 18 days ago
2008
IEEE
Segmenting arbitrary unions of linear subspaces is an important tool for computer vision tasks such as motion and image segmentation, SfM or object recognition. We segment subspac...
163
click to vote
ASPDAC
2001
ACM
15 years 9 months ago
2001
ACM
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...
201
Voted
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
168
Voted
TMC
2010
15 years 4 months ago
2010
—To satisfy the stringent requirement of capacity enhancement in wireless networks, cooperative relaying is envisioned as one of the most effective solutions. In this paper, we s...