2109 search results - page 353 / 422 » Solving Necklace Constraint Problems |
126
click to vote
CN
2004
15 years 4 months ago
2004
There are two basic types of interconnection agreements between providers in the Internet: peering and transit. A decision every Internet network service provider (INSP) has to ma...
167
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
In this paper we propose a robust visual tracking method
by casting tracking as a sparse approximation problem in a
particle filter framework. In this framework, occlusion, corru...
138
click to vote
CVPR
1998
IEEE
16 years 6 months ago
1998
IEEE
We consider the problem of determining whether two images come from different objects or the same object in the same pose, but under different illumination conditions. We show tha...
129
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
We consider the problem of estimating the shape and radiance of an object from a calibrated set of views under the assumption that the reflectance of the object is nonLambertian. ...
138
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...