187 search results - page 10 / 38 » On the uniform edge-partition of a tree |
97
Voted
CPC
2006
14 years 9 months ago
2006
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete g...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
A new approach to Variable Size Block Matching is proposed, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then...
73
Voted
DEXA
2005
Springer
14 years 11 months ago
2005
Springer
The signature file method is a popular indexing technique used in information retrieval and databases. It excels in efficient index maintenance and lower space overhead. Different ...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
NIPS
2001
14 years 10 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...