4451 search results - page 366 / 891 » On Random Ordering Constraints |
159
click to vote
BMVC
2001
15 years 9 months ago
2001
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
150
click to vote
JSYML
2006
15 years 6 months ago
2006
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
167
Voted
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
217
Voted
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
A new family of boosting algorithms, denoted TaylorBoost, is proposed. It supports any combination of loss function and first or second order optimization, and includes classical...
333
click to vote
EMMCVPR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We follow recent work by Schoenemann et al. [25] for expressing curvature regularity as a linear program. While the original formulation focused on binary segmentation, w...