Biblioteca Digital

30 resultados para Playful Computing

Computing the regularities in biological weighted sequences

Relevância:

20.00% 20.00%

Publicador:

Computing Evolutionary Chains in Musical Sequences

Relevância:

20.00% 20.00%

Publicador:

Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata

Relevância:

20.00% 20.00%

Publicador:

Computing the minimum approximate ? -cover of a string

Relevância:

20.00% 20.00%

Publicador:

Algorithms for Computing the Longest Parameterized Common Subsequence

Relevância:

20.00% 20.00%

Publicador:

A New Efficient Algorithm for computing the Longest Common Subsequence

Relevância:

20.00% 20.00%

Publicador:

Algorithms for Computing Variants of the Longest Common Subsequence Problem

Relevância:

20.00% 20.00%

Publicador:

Computing the Repetitions in a Weighted Sequence

Relevância:

20.00% 20.00%

Publicador:

Computing the Repetitions in a Weighted Sequence using Weighted Suffix Trees

Relevância:

20.00% 20.00%

Publicador:

Computing Longest Previous Factor in linear time and applications

Relevância:

20.00% 20.00%

Publicador:

Computing all efficient solutions of the biobjective minimum spanning tree problem

Relevância:

20.00% 20.00%

Publicador:

Computing Longest Previous Factors in linear time and applications

Relevância:

20.00% 20.00%

Publicador:

A simple algorithm for computing the Lempel-Ziv factorization

Relevância:

20.00% 20.00%

Publicador:

Computing a longest increasing subsequence of length k in time O(nloglog k)

Relevância:

20.00% 20.00%

Publicador:

Computing as Interaction: Agent and Agreement Technologies

Relevância:

20.00% 20.00%

Publicador:

«
1
2
»