4820 search results - page 357 / 964 » Implementing Signatures for C |
104
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We prove a variant of a Johnson-Lindenstrauss lemma for matrices with circulant structure. This approach allows to minimise the randomness used, is easy to implement and provides ...
117
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The whole computer hardware industry embraced multicores. For these machines, the extreme optimisation of sequential algorithms is no longer sufficient to squeeze the real machine ...
117
click to vote
ENGL
2007
15 years 4 months ago
2007
— In any information system, the reducts are useful in classifying data. Janusz Starzyk developed an algorithm for computing reducts using strong equivalence and the law of expan...
138
click to vote
MCS
2006
Springer
15 years 4 months ago
2006
Springer
A fractional step lattice Boltzmann scheme is presented to greatly improve the stability of the lattice Boltzmann method (LBM) in modelling incompressible flows at high Reynolds n...
103
click to vote
RAS
2006
15 years 4 months ago
2006
This paper describes an algorithm to calculate near-optimal minimum time trajectories for four wheeled omnidirectional vehicles, which can be used as part of a high-level path pla...