Searching for "Approximate Sorting." – sorted by Relevance.
104 documents found, showing 1 through 10.
Next 10 →
-
Exact and Approximation Algorithms for Sorting By Reversals, With Application to Genome
- …Exact and approximation algorithms for sorting by reversals, with application to genome…
- Cited by 61 (4 self) – Add To MetaCart
-
Discussion on “Approximate Bayesian inference for latent Gaussian models by using
- … to approximations of sorts whose impact was not always completely assessed (see, e.g., Polson et al., 2008…
- Add To MetaCart
-
Scalable Architectures for Integrated Traffic Shaping and Link Scheduling in High-Speed ATM Switches
- … combination of per-connection queueing and approximate sorting, the shaper performs a small, bounded number…
- Cited by 14 (2 self) – Add To MetaCart
-
A Scalable Architecture for Fair Leaky-Bucket Shaping
- …-based scheduling algorithms. Through a careful combination of per-connection queueing and approximate sorting…
- Cited by 6 (1 self) – Add To MetaCart
-
Lower Bounds for Sorting Networks
- … the lower bound to comparator networks that approximately sort a certain fraction of all input permutations…
- Add To MetaCart
-
Lower Bounds for Sorting Networks
- … the lower bound to comparator networks that approximately sort a certain fraction of all input permutations…
- Cited by 1 (0 self) – Add To MetaCart
-
The soft heap: an approximate priority queue with optimal error rate
- … medians and percentiles optimally. It is also useful for approximate sorting and for computing minimum…
- Cited by 9 (1 self) – Add To MetaCart
-
Online Dynamic Reordering for Interactive Data Processing
- … form of pipelined, approximate sorting. 1 Introduction It has often been noted that information…
- Add To MetaCart
-
Improved Bounds on Sorting with Length-Weighted Reversals (Extended Abstract)
- … of sorting by reversals. Then we develop algorithms to approximate the optimal cost to sort a given input…
- Cited by 8 (3 self) – Add To MetaCart
-
Sorting by weighted reversals, transpositions, and inverted transpositions
- … of sorting an unsigned permutation by reversals is NP-hard [9] and the currently best approximation algorithm…
- Cited by 6 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
