Add to ORKGWe present analysis of an efficient algorithm for the approximate median selection problem that has been rediscovered many times, and easy to implement. The contribution of the article is in precise characterization of the accuracy of the algorithm. We present analytical results of the performance of the algorithm, as well as experimental illustrations of its precision
This thesis is concerned with the application of genetic algorithms to solve the p-median problem. T...
By developing and exploiting new in-place techniques, we show that finding the element with the medi...
Median in some statistical methods Abstract: This work is focused on utilization of robust propertie...
We present an efficient randomized algorithm for the approximate k-th selection problem. It works in...
The selection problem, in forms such as finding the median or choosing the k top ranked items in a d...
Improving a long standing result of Schonhage, Paterson and Pippenger we show that the median of a s...
Given a sequence A of n numbers and an integer (target) parameter 1 ? i ? n, the (exact) selection p...
AbstractWe show that several versions of Floyd and Rivest's algorithm SELECT for finding the kth sma...
An algorithm is described which determines the median of n elements using in the worst case a number...
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...
This paper presents a new algorithm that can be used to compute an approximation to the median of a ...
The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a...
The distance of a string from a set of strings is defined by the sum of distances to the strings of ...
A common statistical problem is that of finding the median element in a set of data. This paper pres...
This thesis is concerned with the application of genetic algorithms to solve the p-median problem. T...
By developing and exploiting new in-place techniques, we show that finding the element with the medi...
Median in some statistical methods Abstract: This work is focused on utilization of robust propertie...
We present an efficient randomized algorithm for the approximate k-th selection problem. It works in...
The selection problem, in forms such as finding the median or choosing the k top ranked items in a d...
Improving a long standing result of Schonhage, Paterson and Pippenger we show that the median of a s...
Given a sequence A of n numbers and an integer (target) parameter 1 ? i ? n, the (exact) selection p...
AbstractWe show that several versions of Floyd and Rivest's algorithm SELECT for finding the kth sma...
An algorithm is described which determines the median of n elements using in the worst case a number...
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...
This paper presents a new algorithm that can be used to compute an approximation to the median of a ...
The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a...
The distance of a string from a set of strings is defined by the sum of distances to the strings of ...
A common statistical problem is that of finding the median element in a set of data. This paper pres...
This thesis is concerned with the application of genetic algorithms to solve the p-median problem. T...
By developing and exploiting new in-place techniques, we show that finding the element with the medi...
Median in some statistical methods Abstract: This work is focused on utilization of robust propertie...