Showing papers by "Micha Hofri published in 2006"
01 Jan 2006
TL;DR: Analysis of an efficient algorithm for the approxi mate median selection problem that has been rediscovered many times, and easy to implement, and results of the performance of the algorithm are presented.
Abstract: We present analysis of an efficient algorithm for the approxi mate 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 pre cision. ∗
01 Jan 2006
TL;DR: A saddle point is defined as a matrix entry which is the minimal in its row and the maximal in its column, using sharp inequalities, which also imply that at most one could exist in a matrix.
Abstract: A random matrix has (fixed) dimensions of n rows and m columns, and its elements are random variables, denoted by X , assumed drawn independently from the same given completely continuous distribution F . To remove ambiguity we sometimes write FX . A saddle point is defined as a matrix entry which is the minimal in its row and the maximal in its column, using sharp inequalities, which also imply that at most one could exist in a matrix.