6358 search results - page 1144 / 1272 » Computing spectral sequences |
154
click to vote
TCBB
2011
14 years 11 months ago
2011
—In this paper, we propose a communication model of evolution and investigate its information-theoretic bounds. The process of evolution is modeled as the retransmission of infor...
171
Voted
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Abstract- In order to prevent detection and evade signature-based scanning methods, which are normally exploited by antivirus softwares, metamorphic viruses use several various obf...
150
click to vote
EJC
2010
14 years 11 months ago
2010
As a computational model of natural language communication, Database Semantics1 (DBS) includes a hearer mode and a speaker mode. For the content to be mapped into language expressi...
124
click to vote
JCIT
2010
14 years 11 months ago
2010
For stationary or quasi-stationary frames of a video sequence, traditional block matching algorithms (BMA) will easily lead the search to be trapped into a local minimum. In this ...
143
click to vote
MST
2010
14 years 11 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...