Sciweavers

2621 search results - page 293 / 525
» Near orders and codes
Sort
View
DIMVA
2006
15 years 8 months ago
Detecting Self-mutating Malware Using Control-Flow Graph Matching
Next generation malware will by be characterized by the intense use of polymorphic and metamorphic techniques aimed at circumventing the current malware detectors, based on pattern...
Danilo Bruschi, Lorenzo Martignoni, Mattia Monga
ISCAPDCS
2004
15 years 8 months ago
Semantic Encryption Transformation Scheme
We present a scheme to protect mobile code from malicious hosts. We propose a transformation scheme that changes the semantics of a program using pseudorandom I/O scrambling, cond...
Willard Thompson, Alec Yasinsac, J. Todd McDonald
NAACL
2004
15 years 8 months ago
Inferring Sentence-internal Temporal Relations
In this paper we propose a data intensive approach for inferring sentence-internal temporal relations, which relies on a simple probabilistic model and assumes no manual coding. W...
Mirella Lapata, Alex Lascarides
ANOR
2007
80views more  ANOR 2007»
15 years 6 months ago
Branch and bound, integer, and non-integer programming
In this note we review the development of the first commercial branch and bound codes at CEIR/Scicon, with particular emphasis on those features not commonly emphasized today - t...
John J. H. Forrest, John A. Tomlin
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 6 months ago
The complexity of linear-time temporal logic over the class of ordinals
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
Stéphane Demri, Alexander Rabinovich