Sciweavers

3096 search results - page 533 / 620
» The Generalized FITC Approximation
Sort
View
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
14 years 2 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
CCS
2006
ACM
14 years 1 months ago
Evading network anomaly detection systems: formal reasoning and practical techniques
Attackers often try to evade an intrusion detection system (IDS) when launching their attacks. There have been several published studies in evasion attacks, some with available to...
Prahlad Fogla, Wenke Lee
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
13 years 11 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
BMCBI
2008
159views more  BMCBI 2008»
13 years 10 months ago
Estimation and testing for the effect of a genetic pathway on a disease outcome using logistic kernel machine regression via log
Background: Growing interest on biological pathways has called for new statistical methods for modeling and testing a genetic pathway effect on a health outcome. The fact that gen...
Dawei Liu, Debashis Ghosh, Xihong Lin
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 10 months ago
A Local Mean Field Analysis of Security Investments in Networks
Getting agents in the Internet, and in networks in general, to invest in and deploy security features and protocols is a challenge, in particular because of economic reasons arisi...
Marc Lelarge, Jean Bolot