13 search results - page 2 / 3 » Relaxed Graceful Labellings of Trees |
IJCV
2007
13 years 4 months ago
2007
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
ACCV
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. This paper presents a new algorithm for low-level multiscale segmentation of images. The algorithm is designed to detect image regions regardless of their shapes, sizes, ...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
NIPS
2008
13 years 6 months ago
2008
We introduce a new interpretation of multiscale random fields (MSRFs) that admits efficient optimization in the framework of regular (single level) random fields (RFs). It is base...
SSPR
2004
Springer
13 years 10 months ago
2004
Springer
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...