2735 search results - page 50 / 547 » Comparing notions of randomness |
FSTTCS
1992
Springer
14 years 27 days ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
INFORMATICALT
2006
13 years 8 months ago
2006
The two major Markov Random Fields (MRF) based algorithms for image segmentation are the Simulated Annealing (SA) and Iterated Conditional Modes (ICM). In practice, compared to the...
ILP
2004
Springer
14 years 2 months ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
PODC
1998
ACM
14 years 1 months ago
1998
ACM
We study the relationship between the number of rounds needed to repeatedly perform a private computation i.e., where there are many sets of inputs sequentially given to the play...
COLING
2008
13 years 10 months ago
2008
Och's (2003) minimum error rate training (MERT) procedure is the most commonly used method for training feature weights in statistical machine translation (SMT) models. The u...