14699 search results - page 443 / 2940 » Complexity and Cognitive Computing |
158
click to vote
ISSAC
1998
Springer
15 years 10 months ago
1998
Springer
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
202
click to vote
NIPS
2004
15 years 7 months ago
2004
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
100
Voted
CORR
2007
Springer
15 years 6 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...
180
click to vote
ERCIM
2007
15 years 6 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...
189
click to vote
IANDC
2007
15 years 6 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...