[PDF][PDF] Approximate sorting
J Giesen, E Schuberth… - Fundamenta Informaticae, 2009 - people.dmi.uns.ac.rs
We show that any comparison based, randomized algorithm to approximate any given ranking
of n items within expected Spearman’s footrule distance n2/ν (n) needs at least n (min {…
of n items within expected Spearman’s footrule distance n2/ν (n) needs at least n (min {…
Sorting, approximate sorting, and searching in rounds
… (c) We show that "approximate sorting" in one round requires asymptotically more than cn
log n comparisons, for every constant c, and can be done in O(n log n log log n) comparisons. …
log n comparisons, for every constant c, and can be done in O(n log n log log n) comparisons. …
Approximate sorting
J Giesen, E Schuberth, M Stojaković - Latin American Symposium on …, 2006 - Springer
… Our motivation to study approximate sorting comes from the … nothing else than a comparison
based sorting algorithm. We can … The information theoretic lower bound on sorting [7] states …
based sorting algorithm. We can … The information theoretic lower bound on sorting [7] states …
Approximate sorting
L Busse, M Haghir Chehreghani… - Pattern Recognition: 35th …, 2013 - Springer
… in the pairwise comparisons, sorting from a data source accounts for computing an
approximation set of orders (… The more noise in the data, the larger the approximation set will be. …
approximation set of orders (… The more noise in the data, the larger the approximation set will be. …
Approximate block sorting
… approximation for BLOCK-SORTING, a We have learned from one of the referees that a 2-approximation
algorithm for BLOCK-SORTING … the 2-approximation for BLOCK-SORTING. The …
algorithm for BLOCK-SORTING … the 2-approximation for BLOCK-SORTING. The …
Real-time approximate sorting for self shadowing and transparency in hair rendering
E Sintorn, U Assarsson - Proceedings of the 2008 symposium on …, 2008 - dl.acm.org
… Moreover, in all of the aforementioned examples, properly approximating self shadowing
is … In this paper we present a method for sorting n line primitives into s number of sub-sets, …
is … In this paper we present a method for sorting n line primitives into s number of sub-sets, …
Approximate sorting and its applications in I/O model
T Gao, J Li - Theoretical Computer Science, 2024 - Elsevier
… for big data is to generate an approximate sorted result, but … approximate sorting and
applications for approximate sorted … is approximate sorted or both relations are approximate …
applications for approximate sorted … is approximate sorted or both relations are approximate …
[PDF][PDF] Sorting by address calculation
EJ Isaac, RC Singleton - Journal of the ACM (JACM), 1956 - dl.acm.org
… the "sorting function," can be used by the computer to calculate an approximate address for
… The computer can then use an interfiling procedure beginning at this approximate address. …
… The computer can then use an interfiling procedure beginning at this approximate address. …
Approximate non-dominated sorting for evolutionary many-objective optimization
… In addition, we consider an approximate sorting algorithm that randomly chooses three …
ENS, its three variants and the approximate sorting method that randomly selects three objectives …
ENS, its three variants and the approximate sorting method that randomly selects three objectives …
Approximation quality for sorting rules
G Gediga, I Düntsch - Computational Statistics & Data Analysis, 2002 - Elsevier
… We provide a significance test for the overall approximation … -statistics and the proposed
approximation quality measure is … an upper bound for the approximation quality of sorting rules. …
approximation quality measure is … an upper bound for the approximation quality of sorting rules. …