71228 search results - page 191 / 14246 » Algorithms |
115
click to vote
COLT
1998
Springer
15 years 5 months ago
1998
Springer
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
124
Voted
STOC
1998
ACM
15 years 5 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
ANTS
1994
Springer
15 years 5 months ago
1994
Springer
We propose a fast variant of the Gaussian algorithm for the reduction of two{ dimensional lattices for the l1; l2; and l1;norm. The algorithm runs in at most O(n M(B) logB) bit op...
STOC
1990
ACM
15 years 5 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
132
click to vote
ANTS
2010
Springer
15 years 5 months ago
2010
Springer
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...