101 search results - page 4 / 21 » Optimal Random Matchings on Trees and Applications |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
123
Voted
ICPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
84
Voted
ECCV
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
85
Voted
CVPR
2004
IEEE
16 years 8 days ago
2004
IEEE
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
83
Voted
ALGORITHMICA
2005
14 years 10 months ago
2005
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...