13603 search results - page 170 / 2721 » On the Computational Complexity of Cut-Reduction |
214
click to vote
NIPS
2004
15 years 8 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...
107
click to vote
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...
193
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...
197
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...
186
click to vote
CORR
2004
Springer
15 years 6 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...