68 search results - page 3 / 14 » Optimal Bounds for Matching Routing on Trees |
ICALP
2007
Springer
14 years 6 days ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
ICCS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. With the development of the multicast technology, the realtime strategy among the group applications using the multicast routing is getting more important. An essential f...
IJCGA
2006
13 years 6 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
INFOCOM
2003
IEEE
13 years 11 months ago
2003
IEEE
—In this paper, we formulate an optimization problem for the design of light-tree based logical topology in Wavelength Division Multiplexing (WDM) networks. The problem is compri...
ICPR
2010
IEEE
13 years 11 months ago
2010
IEEE
We propose to use energy minimization in MRFs for matching-based image recognition tasks. To this end, the Tree-Reweighted Message Passing algorithm is modified by geometric cons...