2107 search results - page 76 / 422 » Computing Small Search Numbers in Linear Time |
132
click to vote
CTRSA
2009
Springer
15 years 10 months ago
2009
Springer
CTC is a toy cipher designed in order to assess the strength of algebraic attacks. While the structure of CTC is deliberately weak with respect to algebraic attacks, it was claimed...
ICCS
2005
Springer
15 years 8 months ago
2005
Springer
This paper proposes an innovative algorithm to find the two’s complement of a binary number. The proposed method works in logarithmic time (O(logN)) instead of the worst case li...
105
click to vote
MICCAI
2009
Springer
16 years 4 months ago
2009
Springer
We introduce an efficient search strategy to substantially accelerate feature based registration. Previous feature based registration algorithms often use truncated search strategi...
119
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Min, Veeravalli, and Barlas have proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more ...
150
click to vote
RTSS
2006
IEEE
15 years 9 months ago
2006
IEEE
In many applications we can deploy large number of sensors spanning wide geographical areas, to monitor environmental phenomena. The analysis of the data collected by such sensor ...