13306 search results - page 354 / 2662 » Theoretical Computer Science |
179
click to vote
CCA
2009
Springer
16 years 1 months ago
2009
Springer
We define the computability of probability distributions on the real line as well as that of distribution functions. Mutual relationships between the computability notion of a pro...
156
click to vote
ERSHOV
2006
Springer
15 years 10 months ago
2006
Springer
In the equivalent transformation (ET) computation model, a specification provides background knowledge in a problem domain, a program is a set of prioritized rewriting rules, and c...
136
click to vote
CAD
2006
Springer
15 years 6 months ago
2006
Springer
We introduce an affine extension of the Euler tensor which encompasses all of the inertia properties of interest in a convenient linear format, and we show how it transforms under...
183
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
146
click to vote
COMPLEX
2009
Springer
16 years 1 months ago
2009
Springer
Security vendors are facing a serious problem of defeating the complexity of malwares. With the popularity and the variety of zeroday malware over the Internet, generating their si...