Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Minimum weight

Known as: Minimum Hamming weight 
In error-correcting coding, the minimum Hamming weight, commonly referred to as the minimum weight wmin of a code is the weight of the lowest-weight… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Distributed computing is at the heart of many applications. It arises as soon as one has to solve a problem in terms of entities… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Researchers have proposed weighted frequent itemset mining algorithms that reflect the importance of items. The main focus of… Expand
  • table 1
  • table 2
  • table 3
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Abstract Analytical predictions are made for the three-point bending collapse strength of sandwich beams with composite faces and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We make several observations on the implementation of Edmonds' blossom algorithm for solving minimum-weight perfect matching… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We investigate the minimum weight path problem in networks whose link weights and link delays are both functions of time. We… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1988
Highly Cited
1988
An algorithm is developed that can be used to find, with a very low probability of error (10/sup -100/ or less in many cases… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
This paper develops linear time distributed algorithms for a class of problems in an asynchronous communication network. Those… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Abstract : A distributed algorithm is presented that constructs the minimum weight spanning tree in a connected undirected graph… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1983
Highly Cited
1983
A distributed algorithm is presented for constructing minimum weight directed spanning trees (arborescences), each with a… Expand
  • figure 3
  • figure 4
Is this relevant?