7228 search results - page 103 / 1446 » From Algorithmic to Subjective Randomness |
148
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
160
click to vote
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
118
Voted
OOPSLA
2010
Springer
15 years 1 months ago
2010
Springer
Testing is among the most effective tools available for finding bugs. Still, we know of no automatic technique for generating test cases that expose bugs involving a combination ...
115
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
152
click to vote
PAMI
2008
15 years 3 months ago
2008
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....