885 search results - page 106 / 177 » Random Matrices in Data Analysis |
125
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
108
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
214
click to vote
ICDT
2009
ACM
16 years 3 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
132
click to vote
BMCBI
2008
15 years 2 months ago
2008
Background: The previous studies of genome-wide expression patterns show that a certain percentage of genes are cell cycle regulated. The expression data has been analyzed in a nu...
149
click to vote
BMCBI
2004
15 years 2 months ago
2004
Background: A routine goal in the analysis of microarray data is to identify genes with expression levels that correlate with known classes of experiments. In a growing number of ...