12825 search results - page 399 / 2565 » Improved PLSOM algorithm |
165
click to vote
COLT
1991
Springer
15 years 11 months ago
1991
Springer
Two extensions of the Linial, Mansour, Nisan AC0 learning algorithm are presented. The LMN method works when input examples are drawn uniformly. The new algorithmsimprove on their...
203
Voted
STOC
1994
ACM
15 years 11 months ago
1994
ACM
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
152
click to vote
ANTS
2008
Springer
15 years 9 months ago
2008
Springer
The theory of 4-descent on elliptic curves has been developed in the PhD theses of Siksek [18], Womack [21] and Stamminger [20]. Prompted by our use of 4-descent in the search for ...
160
click to vote
MOC
2000
15 years 7 months ago
2000
The best algorithm known for finding logarithms on an elliptic curve (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a se...
186
click to vote
BMCBI
2006
15 years 7 months ago
2006
Background: Although it is not difficult for state-of-the-art gene finders to identify coding regions in prokaryotic genomes, exact prediction of the corresponding translation ini...