72 search results - page 6 / 15 » Random search can outperform mutation |
60
Voted
IJCNLP
2005
Springer
15 years 3 months ago
2005
Springer
Recent work on Conditional Random Fields (CRFs) has demonstrated the need for regularisation when applying these models to real-world NLP data sets. Conventional approaches to regu...
JCDL
2009
ACM
15 years 4 months ago
2009
ACM
Users of digital libraries usually want to know the exact author or authors of an article. But different authors may share the same names, either as full names or as initials and...
MIR
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we propose a transductive learning method for content-based image retrieval: Multiple Random Walk (MRW). Its basic idea is to construct two generative models by mea...
FGR
2011
IEEE
14 years 1 months ago
2011
IEEE
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
128
click to vote
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...