Results 71 to 80 of about 281,251 (291)
Quick- instead of Merge-sort for pipelines systems [PDF]
, 1997 This paper proposes an external sorting algorithm for large data as an alternative to the widely used merge-sort algorithm. The algorithm we present is an application of the widely known quick-sort algorithm to large sequences of data stored externally ...
Khalaila, Ahmad H., Eliassen, Frank
core
FEBS Letters, EarlyView.Plasma membranes contain dynamic nanoscale domains that organize lipids and receptors. Because viruses operate at similar scales, this architecture shapes early infection steps, including attachment, receptor engagement, and entry. Using influenza A virus and HIV‐1 as examples, we highlight how receptor nanoclusters, multivalent glycan interactions ...
Jan Schlegel, Christian Sieben
wiley +1 more source
SoftwareParallel performance depends not only on programming language and runtime design, but also on how the dominant execution bottleneck changes as parallelism increases.
Muhammad Hassam Aslam Khan +5 more
doaj +1 more source
Nuevo mundo - Mundos Nuevos, 2011 During the last years, scholarship on the topic of memory has grown with fresh impetus within the field of social sciences in Argentina. Many authors have linked this attention to memory with a sort of global cultural turn that would merge in Argentina ...
Mauricio Chama, Hernán Sorgentini
doaj +1 more source
FEBS Letters, EarlyView.Ascidian Ciona larvae initially show strong clockwise tail twisting, which is largely corrected during development. However, a small residual twist remains. This study shows that organized helical myofibrils in tail muscles mechanically stabilize this residual asymmetry, preventing complete restoration of bilateral symmetry and revealing how embryos ...
Yuki S. Kogure +3 more
wiley +1 more source
Menghitung waktu tempuh (T(n) dengan metode master pada algoritma merge-sort [PDF]
, 2001 Untuk mendapatkan waktu tempub (T(n)) pada algoritma merge sort bisa dilakukan dengan menggunakan metode master, yang memiliki bentuk persamaan T(n) = aT(n/b) +fin), dimana a 1, b> dan f (n) adalah suatu fungsi asimtot yang p ositif- - Besarnya waktu ...
Mujiono , Edi
core +1 more source
ANALISIS PERBANDINGAN ALGORITMA BUBBLE SORT, MERGE SORT, DAN QUICK SORT DALAM PROSES PENGURUTAN KOMBINASI ANGKA DAN HURUF [PDF]
, 2016 Peran algoritma dalam perangkat lunak atau pemprograman begitu penting, sehingga perlu memahami konsep dasar algoritma. Begitu banyak logika pemprograman yang telah diciptakan, untuk kasus yang umum dan juga khusus.
Sonita, Anisya, Nurtaneo, Febrian
core
FEBS Letters, EarlyView.Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai +4 more
wiley +1 more source
An Online GPU Hit Finder for the STS Detector in the CBM Experiment [PDF]
EPJ Web of ConferencesThe Compressed Baryonic Matter (CBM) experiment at FAIR will operate at interaction rates up to 10 MHz, generating data streams averaging 500 GB/s. This necessitates efficient online reconstruction capabilities, particularly for the Silicon Tracking ...
Weiglhofer Felix, Lindenstruth Volker
doaj +1 more source
Skew Handling Techniques in Sort-Merge Join
, 2002 Joins are among the most frequently executed operations. Several fast join algorithms have been developed and extensively studied; these can be categorized as sort-merge, hash-based, and index-based algorithms. While all three types of algorithms exhibit
Wei Li +2 more
core