9209 search results - page 177 / 1842 » Data Space Randomization |
126
click to vote
IPL
1998
15 years 4 months ago
1998
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...
143
Voted
TIT
2010
14 years 11 months ago
2010
Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit. We allow for arbitrary chip waveforms and ...
137
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
202
click to vote
BMCBI
2007
15 years 5 months ago
2007
Variable importance measures for random forests have been receiving increased attention as a means of variable selection in many classification tasks in bioinformatics and relate...
110
click to vote
ICPR
2006
IEEE
16 years 6 months ago
2006
IEEE
This paper examines two scene recovery problems arising when interpreting data from massive numbers of randomly distributed single pixel cameras. Assuming that the camera position...