721 search results - page 68 / 145 » On Generators of Random Quasigroup Problems |
124
Voted
MICCAI
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we introduce a novel approach to bridge the gap between the landmark-based and the iconic-based voxel-wise registration methods. The registration problem is formulat...
97
Voted
CIKM
2011
Springer
14 years 2 months ago
2011
Springer
Various semi-supervised learning methods have been proposed recently to solve the long-standing shortage problem of manually labeled data in sentiment classification. However, mos...
108
Voted
TIT
2008
15 years 2 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
107
Voted
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This work introduces a new evolutionary algorithm that adapts the operator probabilities (rates) while evolves the solution of the problem. Each individual encodes its ge...
187
click to vote
Book
"GP is a systematic, domain-independent method for getting computers to solve problems automatically starting from a high-level statement of what needs to be done. Using ideas...