128 search results - page 6 / 26 » Working Smarter, Not Harder |
IWSEC
2007
Springer
14 years 1 months ago
2007
Springer
The problem of defending software against tampering by a malicious host is not expected to be solved soon. Rather than trying to defend against the first attack, randomization tri...
ICSM
2003
IEEE
14 years 25 days ago
2003
IEEE
As systems evolve, they become harder to understand because the implementation of concepts (e.g. business rules) becomes less coherent. To preserve source code comprehensibility, ...
EUROGP
2003
Springer
14 years 23 days ago
2003
Springer
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of ev...
ICANN
2001
Springer
14 years 23 hour ago
2001
Springer
This paper studies the use of discrete-time recurrent neural networks for predicting the next symbol in a sequence. The focus is on online prediction, a task much harder than the c...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...