MP
1998
13 years 9 months ago
1998
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The algorithm accelerates the path following interior-point algorithm and its arithmetic complexity dep...
MOC
1998
13 years 9 months ago
1998
In this paper an unconditional probabilistic algorithm to compute the class number of a real quadratic field Q( √ d) is presented, which computes the class number in expected ti...
MOC
1998
13 years 9 months ago
1998
In this paper we propose an algorithm for evaluation of logarithms in the finite fields Fpn , where the number pn − 1 has a small primitive factor r. The heuristic estimate of ...
MOC
1998
13 years 9 months ago
1998
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...
MOC
1998
13 years 9 months ago
1998
This paper (1) gives complete details of an algorithm to compute approximate kth roots; (2) uses this in an algorithm that, given an integer n > 1, either writes n as a perfect ...
ML
1998
ACM
13 years 9 months ago
1998
ACM
We review the application of statistical mechanics methods to the study of online learning of a drifting concept in the limit of large systems. The model where a feed-forward netwo...
ML
1998
ACM
13 years 9 months ago
1998
ACM
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
LOGCOM
1998
13 years 9 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
MP
2002
13 years 9 months ago
2002
We revise the Volume Algorithm (VA) for linear programming and relate it to bundle methods. When first introduced, VA was presented as a subgradient-like method for solving the ori...
MOC
2002
13 years 9 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...