DOIAbstract
An algorithm is described which determines the median of n elements using in the worst case a number of comparisons asymptotic to 3n
An algorithm is described which determines the median of n elements using in the worst case a number of comparisons asymptotic to 3n
We consider the problem of finding a k-median in a directed tree. We present an algorithm that compu...
The selection problem, in forms such as finding the median or choosing the k top ranked items in a d...
Hoare's Find algorithm can be used to select the jth element out of a file of n elements. It bears a...
An algorithm is described which determines the median of n elements using in the worst case a number...
Abstract. We present a reformulation of the 2n + o(n) lower bound of Bent and John for the number of...
Improving a long standing result of Schonhage, Paterson and Pippenger we show that the median of a s...
TheOnline Median problem requires us to add elements to a set and at any time to produce the median ...
We present analysis of an efficient algorithm for the approximate median selection problem that has ...
By developing and exploiting new in-place techniques, we show that finding the element with the medi...
Consider the problem of estimating the median of N items to a precision ε, i.e. the estimate µ shoul...
Abstract. Median graph is an important new concept introduced to represent a set of graphs by a repr...
In this report, we propose an effective way to find the medians of three permutations by minimizing ...
The ever increasing demand for high image quality requires fast and efficient methods for noise redu...
The time to process each of the W/B processing blocks of a median calculation method on a set of N W...
AbstractWe consider the problem of computing the median of a bag of 2n numbers by using communicatin...
We consider the problem of finding a k-median in a directed tree. We present an algorithm that compu...
The selection problem, in forms such as finding the median or choosing the k top ranked items in a d...
Hoare's Find algorithm can be used to select the jth element out of a file of n elements. It bears a...
An algorithm is described which determines the median of n elements using in the worst case a number...
Abstract. We present a reformulation of the 2n + o(n) lower bound of Bent and John for the number of...
Improving a long standing result of Schonhage, Paterson and Pippenger we show that the median of a s...
TheOnline Median problem requires us to add elements to a set and at any time to produce the median ...
We present analysis of an efficient algorithm for the approximate median selection problem that has ...
By developing and exploiting new in-place techniques, we show that finding the element with the medi...
Consider the problem of estimating the median of N items to a precision ε, i.e. the estimate µ shoul...
Abstract. Median graph is an important new concept introduced to represent a set of graphs by a repr...
In this report, we propose an effective way to find the medians of three permutations by minimizing ...
The ever increasing demand for high image quality requires fast and efficient methods for noise redu...
The time to process each of the W/B processing blocks of a median calculation method on a set of N W...
AbstractWe consider the problem of computing the median of a bag of 2n numbers by using communicatin...
We consider the problem of finding a k-median in a directed tree. We present an algorithm that compu...
The selection problem, in forms such as finding the median or choosing the k top ranked items in a d...
Hoare's Find algorithm can be used to select the jth element out of a file of n elements. It bears a...
Add to ORKG