1611 search results - page 159 / 323 » A Library for Self-Adjusting Computation |
166
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
166
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
191
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We present two novel approaches to parsing context-free languages. The first approach is based on an extension of Brzozowski’s derivative from regular expressions to c...
193
click to vote
ACSAC
2010
IEEE
15 years 4 months ago
2010
IEEE
Instruction-set randomization (ISR) is a technique based on randomizing the "language" understood by a system to protect it from code-injection attacks. Such attacks wer...
145
click to vote
HCW
1998
IEEE
15 years 10 months ago
1998
IEEE
The NetSolve project, underway at the University of Tennessee and at the Oak Ridge National Laboratory, allows users to access computational resources distributed across the netwo...