654 search results - page 102 / 131 » On the Approximation of Computing Evolutionary Trees |
116
click to vote
ECCC
2011
14 years 4 months ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
RAID
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we leverage the concepts of formal grammar and genetic operators to evolve malware. As a case study, we take COM infectors and design their formal grammar with produ...
FPL
2009
Springer
15 years 2 months ago
2009
Springer
As FPGA devices become larger, more coarse-grain modules coupled with large scale reconfigurable fabric become available, thus enabling new classes of applications to run effici...
ICTAC
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Given a nite state machine denoting the speci cation of a system, nding some short interaction sequences capable to reach some/all states or transitions of this machine...
RECOMB
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...