1061 search results - page 99 / 213 » A general definition of malware |
165
click to vote
ACL
1997
15 years 7 months ago
1997
Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time O([Gl[w[3-e) on a grammar G and a string w...
185
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
145
click to vote
AMC
2008
15 years 6 months ago
2008
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
155
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Persistent Topology studies topological features of shapes by analyzing the lower level sets of suitable functions, called filtering functions, and encoding the arising i...
135
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph D has an upward planar embedding into a point set S. W...