Sciweavers

3868 search results - page 763 / 774
» Open Systems in TLA
Sort
View
IANDC
2006
77views more  IANDC 2006»
13 years 7 months ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank
JMLR
2006
132views more  JMLR 2006»
13 years 7 months ago
Learning to Detect and Classify Malicious Executables in the Wild
We describe the use of machine learning and data mining to detect and classify malicious executables as they appear in the wild. We gathered 1,971 benign and 1,651 malicious execu...
Jeremy Z. Kolter, Marcus A. Maloof
ENTCS
2007
113views more  ENTCS 2007»
13 years 7 months ago
Modular Checkpointing for Atomicity
Transient faults that arise in large-scale software systems can often be repaired by re-executing the code in which they occur. Ascribing a meaningful semantics for safe re-execut...
Lukasz Ziarek, Philip Schatz, Suresh Jagannathan
JSA
2006
97views more  JSA 2006»
13 years 7 months ago
Dynamic feature selection for hardware prediction
It is often possible to greatly improve the performance of a hardware system via the use of predictive (speculative) techniques. For example, the performance of out-of-order micro...
Alan Fern, Robert Givan, Babak Falsafi, T. N. Vija...
IEICET
2007
73views more  IEICET 2007»
13 years 7 months ago
An ON-OFF Multi-Rate Loss Model of Finite Sources
Bursty traffic is dominant in modern communication networks and keeps the call-level QoS assessment an open issue. ON-OFF traffic models are commonly used to describe bursty tra...
Ioannis D. Moscholios, Michael D. Logothetis, Mich...