824 search results - page 52 / 165 » Weighted Low-Rank Approximations |
112
click to vote
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
JMLR
2010
2010
Maximum Likelihood in Cost-Sensitive Learning: Model Specification, Approximations, and Upper Bounds
14 years 4 months ago
The presence of asymmetry in the misclassification costs or class prevalences is a common occurrence in the pattern classification domain. While much interest has been devoted to ...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...