Results 291 to 300 of about 1,220,517 (342)
Some of the next articles are maybe not open access.
ACM SIGCSE Bulletin, 2008
Ronald Baecker's Sorting Out Sorting (SOS) set the stage for much of what has followed in the evolution of algorithm visualization (AV). That period of evolution has now spanned over a quarter century, and we have learned much about how to effectively use AV.
David Furcy +2 more
openaire +1 more source
Ronald Baecker's Sorting Out Sorting (SOS) set the stage for much of what has followed in the evolution of algorithm visualization (AV). That period of evolution has now spanned over a quarter century, and we have learned much about how to effectively use AV.
David Furcy +2 more
openaire +1 more source
The Journal of Finance, 1997 In this paper we analyze the theoretical implications of sorting data into groups and then running asset pricing tests within each group. We show that the way this procedure is implemented introduces a bias in favor of rejecting the model under consideration.
openaire +1 more source
Accident and Emergency Nursing, 1997
Each year in Accident and Emergency an increasing number of young people present with acute problems related to social drugs. These problems range from mild symptoms to life-threatening conditions, many of which can be extremely difficult and time consuming for staff to manage.
openaire +2 more sources
Each year in Accident and Emergency an increasing number of young people present with acute problems related to social drugs. These problems range from mild symptoms to life-threatening conditions, many of which can be extremely difficult and time consuming for staff to manage.
openaire +2 more sources
Fundamenta Informaticae, 2006
We show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n ^{2} /ν(n) needs at least n (min{log ν(n), log n} − 6) comparisons in the worst case. This bound is tight up to a constant factor since there exists a deterministic algorithm that shows that 6n log (n ...
Giesen, Joachim +2 more
openaire +1 more source
We show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n ^{2} /ν(n) needs at least n (min{log ν(n), log n} − 6) comparisons in the worst case. This bound is tight up to a constant factor since there exists a deterministic algorithm that shows that 6n log (n ...
Giesen, Joachim +2 more
openaire +1 more source
SSRN Electronic Journal, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kaya, Ayça, Vereshchagina, Galina
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kaya, Ayça, Vereshchagina, Galina
openaire +1 more source
Journal of Algorithms, 1998
Summary: This paper develops a simple and practical hybrid of MergeSort and QuickSort, called Quadripartite Sort. We first divide a sequence into two blocks, and sort one block on the right, then transform two blocks into four blocks such that the maximal element of the leftmost two blocks is less than or equal to the minimal element of the two ...
openaire +2 more sources
Summary: This paper develops a simple and practical hybrid of MergeSort and QuickSort, called Quadripartite Sort. We first divide a sequence into two blocks, and sort one block on the right, then transform two blocks into four blocks such that the maximal element of the leftmost two blocks is less than or equal to the minimal element of the two ...
openaire +2 more sources
2013
Keeping items in order is at the essence of organizing information. This paper derives an information theoretic method for approximate sorting. It is optimal in the sense that it extracts as much reliable order information as possible from possibly noisy comparison input data.
Busse Ludwig M. +2 more
openaire +1 more source
Keeping items in order is at the essence of organizing information. This paper derives an information theoretic method for approximate sorting. It is optimal in the sense that it extracts as much reliable order information as possible from possibly noisy comparison input data.
Busse Ludwig M. +2 more
openaire +1 more source
Science, 2015
Protein Targeting The sorting of proteins into appropriate compartments is vital for proper cell function. After its discovery 20 years ago, various potential roles for nascent chain-associated complex (NAC) in the specificity of intracellular protein sorting have been proposed. Until now, no clear phenotypes have been discovered.
openaire +1 more source
Protein Targeting The sorting of proteins into appropriate compartments is vital for proper cell function. After its discovery 20 years ago, various potential roles for nascent chain-associated complex (NAC) in the specificity of intracellular protein sorting have been proposed. Until now, no clear phenotypes have been discovered.
openaire +1 more source