14774 search results - page 194 / 2955 » Computational complexity and evolutionary computation |
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
152
click to vote
ERCIM
2007
15 years 4 months ago
2007
With the advent of Grid and application technologies, scientists and engineers are building more and more complex applications to manage and process large data sets, and execute s...
162
click to vote
IANDC
2007
15 years 4 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
154
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
127
Voted
TVCG
2010
15 years 3 months ago
2010
—We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology c...