3172 search results - page 210 / 635 » New developments of the Z-EDM algorithm |
164
click to vote
CHINAF
2008
15 years 6 months ago
2008
Pairing-based cryptosystems have been developing very fast in the last few years. The efficiencies of the cryptosystems are determined by the computation of the Tate pairing. In th...
147
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
166
click to vote
IDA
2008
Springer
15 years 6 months ago
2008
Springer
A principally new approach to the classifications of nucleotide sequences based on the "natural" classification concept is proposed. As a result of "natural" c...
130
click to vote
ANOR
2002
15 years 6 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
170
click to vote
JGO
2010
15 years 4 months ago
2010
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...