2754 search results - page 23 / 551 » Distributed Weighted Matching |
121
click to vote
ICS
2010
Tsinghua U.
15 years 4 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
104
click to vote
CORR
2008
Springer
15 years 26 days ago
2008
Springer
The Hamming weight enumerator function of the formally self-dual even, binary extended quadratic residue code of prime p = 8m + 1 is given by Gleason's theorem for singly-eve...
117
click to vote
SIAMCOMP
2000
15 years 16 days ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
118
Voted
ICMLA
2008
15 years 2 months ago
2008
This article presents a method for the calculating similarity of two trajectories. The method is especially designed for a situation where the points of the trajectories are distr...
115
Voted
CORR
2006
Springer
15 years 24 days ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...