732 search results - page 15 / 147 » Strongly Non-U-Shaped Learning Results by General Techniques |
IJNSEC
2008
13 years 7 months ago
2008
In this paper we demonstrate that it is possible in general to detect Windows-based malicious program behavior. Since S. Forrest et al. used the N-grams method to classify system ...
EWCBR
2004
Springer
14 years 28 days ago
2004
Springer
Knowledge-intensive CBR assumes that cases are enriched with general domain knowledge. In CREEK, there is a very strong coupling between cases and general domain knowledge, in that...
NIPS
2004
13 years 9 months ago
2004
Many works have shown that strong connections relate learning from examples to regularization techniques for ill-posed inverse problems. Nevertheless by now there was no formal ev...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
This paper addresses the desktop search problem by considering various techniques for ranking results of a search query over the file system. First, basic ranking techniques, whic...
AAAI
1997
13 years 9 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...