Results 171 to 180 of about 196,748 (236)

Research on Enhanced Dynamic Pig Counting Based on YOLOv8n and Deep SORT. [PDF]

open access: yesSensors (Basel)
Shen P   +7 more
europepmc   +1 more source

Storm over science: predatory practices and the fight for research reliability. [PDF]

open access: yesMicrolife
de Lorenzo V   +6 more
europepmc   +1 more source

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.
Drysdale, R. L. III, Young, Frank H.
openaire   +3 more sources

Efficient unbalanced merge–sort

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

Sort, merge, repeat

Proceedings of the 6th Eurographics Symposium on Sketch-Based Interfaces and Modeling, 2009
Free-sketch recognition systems attempt to recognize freely-drawn sketches without placing stylistic constraints on the users. Such systems often recognize shapes by using geometric primitives that describe the shape's appearance rather than how it was drawn.
A. Wolin, B. Paulson, T. Hammond
openaire   +1 more source

Home - About - Disclaimer - Privacy