247 search results - page 10 / 50 » Extracting All the Randomness from a Weakly Random Source |
CP
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We study the experimental consequences of a recent theoretical result by Achlioptas et al. that shows that conventional models of random problems are trivially insoluble ...
SAC
2003
ACM
14 years 22 days ago
2003
ACM
DNA microarray hybridisation is a popular high throughput technique in academic as well as industrial functional genomics research. In this paper we present a new approach to auto...
MCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
We present a new approach to robust pose-variant face
recognition, which exhibits excellent generalization ability
even across completely different datasets due to its weak
depe...
TIT
1998
13 years 7 months ago
1998
—We study the following problem: two agents Alice and Bob are connected to each other by independent discrete memoryless channels. They wish to generate common randomness, i.e., ...