697 search results - page 30 / 140 » Convex Functions on Discrete Sets |
ACMSE
2010
ACM
13 years 4 months ago
2010
ACM
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
JMLR
2012
11 years 11 months ago
2012
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
MVA
2000
13 years 10 months ago
2000
Previous works on range image segmentation concentrate on surface patches that can be well represented by certain mathematical functions. In this paper we consider the more qualit...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
MP
2011
13 years 3 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...