1315 search results - page 203 / 263 » Discovering significant rules |
106
click to vote
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
105
click to vote
SAC
2006
ACM
15 years 5 months ago
2006
ACM
Web applications are becoming the dominant way to provide access to on-line services. At the same time, web application vulnerabilities are being discovered and disclosed at an al...
120
click to vote
ECBS
2005
IEEE
15 years 5 months ago
2005
IEEE
This paper describes a comprehensive prototype of large-scale fault adaptive embedded software developed for the proposed Fermilab BTeV high energy physics experiment. Lightweight...
123
click to vote
CCS
2005
ACM
15 years 5 months ago
2005
ACM
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
107
click to vote
RSFDGRC
2005
Springer
15 years 5 months ago
2005
Springer
The paper concerns failing queries in incomplete Distributed Autonomous Information Systems (DAIS) based on attributes which are hierarchical and which semantics at different site...