732 search results - page 15 / 147 » Strongly Non-U-Shaped Learning Results by General Techniques |
104
click to vote
IJNSEC
2008
14 years 11 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 ...
100
click to vote
EWCBR
2004
Springer
15 years 5 months 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...
104
Voted
NIPS
2004
15 years 1 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
16 years 13 days 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...
77
Voted
AAAI
1997
15 years 1 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...