Results 231 to 240 of about 281,251 (291)

SPARTAN: automated table detection and extraction from documents using advanced OpenCV heuristics and OCR techniques. [PDF]

Sci Rep
Nandurbarkar S, Chaudhari AY, Mulla R.
europepmc   +1 more source

Trajectory Planning Method for a Robotic Arm Based on an Improved Multi-Objective Golden Jackal Optimization Algorithm. [PDF]

Sensors (Basel)
Wei J, Wang J, Yang M, Feng B.
europepmc   +1 more source

Efficient unbalanced merge–sort

Information Sciences, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. NARDELLI, PROIETTI, GUIDO
openaire   +7 more sources

Accelerating the Merge Phase of Sort-Merge Join [PDF]

2019 29th International Conference on Field Programmable Logic and Applications (FPL), 2019
We present an efficient, high-throughput and scalable hardware design for accelerating the merge phase of the sort-merge join operation. Sort-merge join is one of the fundamental join algorithms and among the most frequently executed operations in relational databases.
Philippos Papaphilippou, Holger Pirk, Wayne Luk   +2 more
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Improved Divide/Sort/Merge Sorting Networks

SIAM Journal on Computing, 1975
This paper develops sorting networks using the divide/sort/merge strategy. These networks require \[ (0.25)N( \log _2 N )^2 - (0.386)N( \log _2 N ) + O(N) \] comparison-interchanges to sort a list of length N. This is an improvement of order $N(\log _2 N)$ over the best networks previously reported.
Robert L. (Scot) Drysdale III, Frank H. Young   +1 more
exaly   +2 more sources

Length of strings for a merge sort

Communications of the ACM, 1963
Detailed statistics are given on the length of maximal sorted strings which result from the first (internal sort) phase of a merge sort onto tapes. It is shown that the strings produced by an alternating method (i.e. one which produces ascending and descending strings alternately) tend to be only three-fourths as long as those in a method which ...
Donald E. Knuth
openaire   +5 more sources

Parallel merge sort with double merging

2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT), 2014
Sorting is one of the fundamental problems in computer science. With the proliferation of multi core processors, parallel algorithms for sorting have become very important. In this study, we propose a new parallel merge sort algorithm in which two threads perform the merge operation simultaneously.
Ahmet Uyar
exaly   +2 more sources

Recursive merge sort with erroneous comparisons [PDF]

Discrete Applied Mathematics, 2011
In this paper, we analyze the recursive merge sort algorithm and quantify the deviation of the output from the correct sorted order if the outcomes of one or more comparisons are in error.
Petros Hadjicostas
exaly   +2 more sources

Lazy Merge Sort: An Improvement over Merge Sort

2024 International Conference on Electrical Electronics and Computing Technologies (ICEECT)
Sachin Pandey, Anika Gupta
exaly   +2 more sources