Examples of using This algorithm can in English and their translations into French
{-}
-
Colloquial
-
Official
This algorithm can be divided into 2 phases.
The latest source code implementing this algorithm can be downloaded here.
However, this algorithm cannot yet be applied.
In 1970, Matiassevitch showed that this algorithm can not be written.
This algorithm can be used on the whole image.
The latest source code implementing this algorithm can be downloaded here.
This algorithm can work in two ways.
When there is convergence,the speed of convergence of this algorithm can be extremely slow;
This algorithm can be briefly described hereafter.
The known form of this algorithm can be represented as follows.
This Algorithm Can Tell If You're Drunk on Twitter.
Needless to say, this algorithm can only understand objects/classes it has learned.
This algorithm can run on anyone's computer.
Exploiting this algorithm can be a great strategy for getting what you want.
This algorithm can estimate the severity of a fault.
This algorithm can easily be implemented on any computer.
This Algorithm Can Tell If You're Drunk on Twitter.
This algorithm can find the global and local optimum solutions.
This algorithm can be seen as an hybrid recommender system.
This algorithm can be used for both classification regression problems.
This algorithm can use different key length to encrypt the data;
This algorithm cannot be customized on a per auction basis.
This algorithm can spot extremist propaganda with 94 percent accuracy.
This algorithm can also use data coming from the flight controls of the aircraft.
This algorithm can be used for determination of oil or gas amount in the field.
This algorithm can be used on a computer for systems with thousands of equations and unknowns.
This algorithm can be used according to two possible configurations which determine its execution time.
This algorithm can be derandomized using the method of conditional probabilities.
This algorithm can differentiate only two types of groups of classes+/-(or 1/0) obtained at the output of the neuron.
This algorithm can be represented as a pyramid, at each step a term disappears until having a single final result.