1941 search results - page 241 / 389 » On the Hardness of Approximate Reasoning |
146
click to vote
KBSE
1997
IEEE
15 years 10 months ago
1997
IEEE
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
160
click to vote
CONTEXT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A key challenge in information retrieval is the use of contextual evidence within ad-hoc retrieval. Our contribution is particularly based on the belief that contextual r...
137
click to vote
CSB
2004
IEEE
15 years 10 months ago
2004
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
151
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
Web applications are the Achilles heel of our current ICT infrastructure. NIST's national vulnerability database clearly shows that the percentage of vulnerabilities located ...
172
click to vote
CEAS
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we detail the use of e-mail social network analysis for the detection of security policy violations on computer systems. We begin by formalizing basic policies that ...