Merge algorithm

Known as: Merge tree, Balanced k-way merge sort, K-way merge 
Merge algorithms are a family of algorithms that take multiple sorted lists as input and produce a single list as output, containing all the elements… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Hadoop is a popular open-source implementation of the MapReduce programming model for cloud computing. However, it faces a number… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Image segmentation is a feverish issue as it is a challenging job and most digital imaging applications require it as a… (More)
  • figure I
Is this relevant?
2007
2007
Split-merge algorithm is a general approach for image segmentation based on region growing. Firstly a new merge criterion is… (More)
  • figure 1
  • figure 2
  • table 2
  • figure 3
  • table 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Hierarchical clustering constructs a hierarchy of clusters by either repeatedly merging two smaller clusters into a larger one or… (More)
  • table 2
  • table 1
  • table 3
Is this relevant?
1998
1998
We propose a new iterative algorithm for the generation of a codebook in vector quantization. The algorithm starts with an… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1996
Highly Cited
1996
High-performance transaction system applications typically insert rows in a History table to provide an activity trace; at the… (More)
  • figure 2.1
  • figure 2.2
  • figure 3.1
  • figure 3.1
  • figure 6.1
Is this relevant?
1996
1996
Usually, segmentation algorithms implementing the split and merge operations are restricted to a split stage followed by a merge… (More)
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1989
Highly Cited
1989
In this paper we analyze and compare four parallel join algorithms. Grace and Hybrid hash represent the class of hash-based join… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1972
Highly Cited
1972
In this paper we present a new algorithm for merging two linearly ordered sets which requires substantially fewer comparisons… (More)
  • table 2
  • table 4
Is this relevant?
1961
1961
The <italic>k</italic>-generalized Fibonacci numbers are defined as in [1]. A polyphase merge (merging an equal number of… (More)
Is this relevant?