Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Shih-Hsiang Lin, Pei-Yin Chen, Yu-Ning Lin
- IEEE Transactions on Computers
- 2017

Sorting is one of the most fundamental topics in computer science. Since partial sorting with lower costs would be much more… Expand

Is this relevant?

2016

2016

- Artjom Rjabov
- 15th Biennial Baltic Electronics Conference (BEC)
- 2016

Fast data sorting is an essential component of many high-performance computing systems. High-throughput and highly parallel… Expand

Is this relevant?

2013

2013

- Amin Farmahini Farahani, Henry J. Duwe, Michael J. Schulte, Katherine Compton
- IEEE Transactions on Computers
- 2013

High-throughput and low-latency sorting is a key requirement in many applications that deal with large amounts of data. This… Expand

Is this relevant?

2012

2012

- Kimikazu Kato, Tikara Hosino
- Concurrency and Computation: Practice and…
- 2012

SUMMARY
The recommendation system is a mechanism which automatically recommends items that are likely to be of interest to the… Expand

Is this relevant?

2011

2011

The partial sorting problem is to sort the k smallest elements of a given set of n integers such that 1 <k <n in descending order… Expand

Is this relevant?

2009

2009

- Kimikazu Kato, Tikara Hosino
- 10th IEEE/ACM International Conference on Cluster…
- 2009

A recommendation system is a software system to predict customers' unknown preferences from known preferences. In a… Expand

Is this relevant?

2007

2007

You are back from that very long, marvelous journey. You have a thousand pictures, but your friends and relatives will stand just… Expand

Is this relevant?

2006

2006

- Markus Kuba
- Inf. Process. Lett.
- 2006

We present explicit solutions of a class of recurrences related to the Quickselect algorithm. Thus we are immediately able to… Expand

Is this relevant?

1996

1996

- Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka
- ICS '96
- 1996

Multidimensional binary search tree (abbreviated k-d tree) is a popular data structure for the organization and manipulation of… Expand

Is this relevant?

1982

1982

- J. J. Brennan
- Oper. Res. Lett.
- 1982

Two partial sorting algorithms used in conjunction with Kruskal's algorithm to find minimal spanning trees, are tested. The… Expand

Is this relevant?

By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License

ACCEPT & CONTINUE