Sciweavers

4137 search results - page 155 / 828
» On the number of matchings of a tree
Sort
View
ICC
2007
IEEE
140views Communications» more  ICC 2007»
16 years 26 days ago
Performance Analysis for Overlay Multicast on Tree and M-D Mesh Topologies
— Without the multicast support from the underlying networks, overlay multicast has the advantage of implementing inter-domain multicast communications. Usually, overlay multicas...
Wanqing Tu
WG
2004
Springer
15 years 12 months ago
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
Mordecai J. Golin, Yiu-Cho Leung
RSA
2010
89views more  RSA 2010»
15 years 4 months ago
A system of grabbing particles related to Galton-Watson trees
We consider a system of particles with arms that are activated randomly to grab other particles as a toy model for polymerization. We assume that the following two rules are ful...
Jean Bertoin, Vladas Sidoravicius, Maria Eulalia V...
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
16 years 3 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang
CVPR
1998
IEEE
16 years 8 months ago
A Statistical Framework for Long-Range Feature Matching in Uncalibrated Image Mosaicing
The problem considered in this paper is that of estimating the projective transformation between two images in situations where the image motion is large and featurematching is no...
Tat-Jen Cham, Roberto Cipolla