Je was op zoek naar: subsequence (Engels - Portugees)

Engels

Vertalen

subsequence

Vertalen

Portugees

Vertalen
Vertalen

Vertaal onmiddellijk teksten, documenten en gesprekken met Lara

Nu vertalen

Menselijke bijdragen

Van professionele vertalers, bedrijven, webpagina's en gratis beschikbare vertaalbronnen.

Voeg een vertaling toe

Engels

Portugees

Info

Engels

subsequence

Portugees

subsequência

Laatste Update: 2014-11-14
Gebruiksfrequentie: 6
Kwaliteit:

Referentie: IATE

Engels

this is not to be confused with subsequence, which is a generalization of substring.

Portugees

não deve ser confundido com subsequência, que é uma generalização de subcadeia.

Laatste Update: 2016-03-03
Gebruiksfrequentie: 1
Kwaliteit:

Referentie: IATE

Engels

if this sequence is uniformly bounded and equicontinuous, then there exists a subsequence ("fnk") that converges uniformly.

Portugees

se essa sequência é uniformemente limitada e equicontínua, então existe uma subsequencia que converge uniformemente.

Laatste Update: 2016-03-03
Gebruiksfrequentie: 1
Kwaliteit:

Referentie: IATE
Waarschuwing: Bevat onzichtbare HTML-opmaak

Engels

if formula_13 is a substring of formula_14, it is also a subsequence, which is a more general concept.

Portugees

se formula_13 é uma subcadeia de formula_14, também é uma subsequência, que é um conceito mais geral.

Laatste Update: 2016-03-03
Gebruiksfrequentie: 1
Kwaliteit:

Referentie: IATE

Engels

for example, "itwastimes" is a subsequence of "it was the best of times", but not a substring.

Portugees

por exemplo, "foitempos" é uma subsequência de "foi o melhor dos tempos", mas não é uma subcadeia.

Laatste Update: 2016-03-03
Gebruiksfrequentie: 1
Kwaliteit:

Referentie: IATE
Waarschuwing: Bevat onzichtbare HTML-opmaak

Engels

in another class of perfect graphs, the permutation graphs, a maximum clique is a longest decreasing subsequence of the permutation defining the graph and can be found using known algorithms for the longest decreasing subsequence problem.

Portugees

em outra classe de grafos perfeitos, os grafos de permutação, o clique máximo é a mais longa sub seqüência decrescente da permutação definindo o grafo e pode ser achada usando algoritmos conhecidos para esse problema.

Laatste Update: 2016-03-03
Gebruiksfrequentie: 1
Kwaliteit:

Referentie: IATE

Engels

if, in addition, the sequence of second derivatives is also uniformly bounded, then the derivatives also converge uniformly (up to a subsequence), and so on.

Portugees

se a derivada segunda também é uniformemente limitada, as derivadas também convergem uniformemente.

Laatste Update: 2016-03-03
Gebruiksfrequentie: 1
Kwaliteit:

Referentie: IATE

Engels

* a compact hausdorff space "x" with "_x_" < 2k is sequentially compact, i.e., every sequence has a convergent subsequence.

Portugees

* um espaço compacto hausdorff "x" com "_x_" < 2k é sequencialmente compacto, i.e., toda sequência tem uma subsequência convergente.

Laatste Update: 2016-03-03
Gebruiksfrequentie: 1
Kwaliteit:

Referentie: IATE
Waarschuwing: Bevat onzichtbare HTML-opmaak

Krijg een betere vertaling met
10,227,807,921 menselijke bijdragen

Gebruikers vragen nu voor assistentie



Wij gebruiken cookies om u de best mogelijke ervaring op onze website te bieden. Door de website verder te gebruiken, geeft u toestemming voor het gebruik van cookies. Klik hier voor meer informatie. OK