63 search results - page 9 / 13 » Bounds on linear PDEs via semidefinite optimization |
WIOPT
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...
NIPS
2008
14 years 11 months ago
2008
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
SIAMNUM
2011
14 years 4 months ago
2011
This paper gives a numerical validation of the continuous mesh framework introduced in Part I [23]. We numerically show that the interpolation error can be evaluated analytically o...
ICCV
2009
IEEE
14 years 7 months ago
2009
IEEE
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...