243 search results - page 18 / 49 » Generation of Transfer Functions with Stochastic Search Tech... |
ALMOB
2006
13 years 7 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
EVOW
2007
Springer
14 years 1 months ago
2007
Springer
Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated. Acceleration of a memetic algorithm requires focusing ...
FLAIRS
2004
13 years 8 months ago
2004
We illustrate that Web searches can often be utilized to generate background text for use with text classification. This is the case because there are frequently many pages on the...
TCS
2010
13 years 5 months ago
2010
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
CCS
2010
ACM
13 years 7 months ago
2010
ACM
Attackers often take advantage of vulnerabilities in benign software, and the authors of benign software must search their code for bugs in hopes of finding vulnerabilities before...