4377 search results - page 114 / 876 » Mass problems and randomness |
176
click to vote
SLSFS
2005
Springer
15 years 11 months ago
2005
Springer
Random projection is a simple technique that has had a number of applications in algorithm design. In the context of machine learning, it can provide insight into questions such as...
126
click to vote
STOC
1992
ACM
15 years 9 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
257
click to vote
BMCBI
2006
15 years 5 months ago
2006
Background: Selection of relevant genes for sample classification is a common task in most gene expression studies, where researchers try to identify the smallest possible set of ...
147
click to vote
COMBINATORICS
2004
15 years 5 months ago
2004
Erdos posed the problem of how many random subsets need to be chosen from a set of n elements, each element appearing in each subset with probability p = 1/2, in order that at lea...
158
click to vote
MOC
2000
15 years 5 months ago
2000
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...