534 search results - page 21 / 107 » Power from Random Strings |
CORR
2008
Springer
13 years 7 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...
TAGT
1994
Springer
13 years 11 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
CRYPTO
2012
Springer
11 years 9 months ago
2012
Springer
It is notoriously difficult to create hardware that is immune from side channel and tampering attacks. A lot of recent literature, therefore, has instead considered algorithmic de...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We develop an abstract model of information acquisition from redundant data. We assume a random sampling process from data which contain information with bias and are interested in...
ICCAD
1997
IEEE
13 years 11 months ago
1997
IEEE
A power estimation approach is presented in which blocks of consecutive vectors are selected at random from a user-supplied realistic input vector set and the circuit is simulated...