3719 search results - page 224 / 744 » order 2010 |
173
click to vote
TAMC
2010
Springer
15 years 9 months ago
2010
Springer
In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity functi...
149
click to vote
CAV
2010
Springer
15 years 9 months ago
2010
Springer
We address the issue of automatic invariant synthesis for sequential programs manipulating singly-linked lists carrying data over infinite data doe define for that a framework ba...
141
click to vote
EVOW
2010
Springer
15 years 9 months ago
2010
Springer
A challenging problem in bioinformatics is the detection of residues that account for protein function specificity, not only in order to gain deeper insight in the nature of functi...
167
click to vote
FUN
2010
Springer
15 years 9 months ago
2010
Springer
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
151
click to vote
MSR
2010
ACM
15 years 7 months ago
2010
ACM
Abstract—Change prediction helps developers by recommending program entities that will have to be changed alongside the entities currently being changed. To evaluate their accura...