2434 search results - page 108 / 487 » Algorithmic Randomness of Closed Sets |
205
Voted
SIGECOM
2011
ACM
14 years 6 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
216
Voted
ICIP
2010
IEEE
15 years 1 months ago
2010
IEEE
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...
131
Voted
SAC
2003
ACM
15 years 8 months 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...
139
Voted
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
133
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...