Sciweavers

4137 search results - page 121 / 828
» On the number of matchings of a tree
Sort
View
ICNP
2000
IEEE
15 years 11 months ago
An Analysis of Packet Loss Correlation in FEC-Enhanced Multicast Trees
We study group loss probabilities of Forward Error Correction (FEC) codes in shared loss multicast communication. We present a new analysis model with explicit state equations usi...
Marc Mosko, J. J. Garcia-Luna-Aceves
BIRTHDAY
2008
Springer
15 years 8 months ago
Tree Automata over Infinite Alphabets
A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare ...
Michael Kaminski, Tony Tan
IPL
2006
72views more  IPL 2006»
15 years 6 months ago
Acyclic colorings of products of trees
We obtain bounds for the coloring numbers of products of trees for three closely related types of colorings: acyclic, distance 2, and L(2, 1).
Robert E. Jamison, Gretchen L. Matthews, John Vill...
SOFSEM
2007
Springer
16 years 17 days ago
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Ku...
ICIP
2000
IEEE
16 years 8 months ago
Image Registration with Minimum Spanning Tree Algorithm
Registration is a fundamental task in image processing and quite a few registration techniques have been developed in various fields. In this paper we propose a novel graphreprese...
Bing Ma, Alfred O. Hero III, John D. Gorman, Olivi...