2020 search results - page 129 / 404 » Speeding up Slicing |
99
Voted
RECOMB
2003
Springer
16 years 1 months ago
2003
Springer
It is shown that structural similarity between proteins can be decided well with much less information than what is used in common similarity measures. The full C representation c...
105
Voted
DCC
2008
IEEE
16 years 12 days ago
2008
IEEE
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...
DCC
2006
IEEE
16 years 12 days ago
2006
IEEE
Recently, Eisentr?ager et al. proposed a very elegant method for speeding up scalar multiplication on elliptic curves. Their method relies on improved formulas for evaluating S = (...
68
Voted
ICCD
2001
IEEE
15 years 9 months ago
2001
IEEE
In 1987 Sedlak proposed a modulo multiplication algorithm which is suitable for smart card implementation due to it’s low latency time. It is based on ZDN (zwei_drittel_N) arith...
100
Voted
FASE
2010
Springer
15 years 7 months ago
2010
Springer
Actor programs consist of a number of concurrent objects called actors, which communicate by exchanging messages. Nondeterminism in actors results from the different possible orde...