598 search results - page 40 / 120 » Approximation Algorithms for the Bottleneck Stretch Factor P... |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
3DPVT
2004
IEEE
14 years 7 days ago
2004
IEEE
We examine the implications of shape on the process of finding dense correspondence and half-occlusions for a stereo pair of images. The desired property of the depth map is that ...
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
— Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the ...
CVPR
2010
IEEE
13 years 6 months ago
2010
IEEE
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
Recently Non-negative Matrix Factorization (NMF) has received a lot of attentions in information retrieval, computer vision and pattern recognition. NMF aims to find two non-nega...