Sciweavers

1449 search results - page 37 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
94
Voted
ICAI
2007
15 years 1 months ago
Dynamic Programming Algorithm for Training Functional Networks
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...
Emad A. El-Sebakhy, Salahadin Mohammed, Moustafa E...
AIEDAM
2008
127views more  AIEDAM 2008»
15 years 19 days ago
Evolving blackbox quantum algorithms using genetic programming
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter
JMLR
2010
118views more  JMLR 2010»
14 years 7 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
83
Voted
JC
2008
77views more  JC 2008»
15 years 14 days ago
A numerical algorithm for zero counting, I: Complexity and accuracy
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
Felipe Cucker, Teresa Krick, Gregorio Malajovich, ...
107
Voted
ANTS
2010
Springer
250views Algorithms» more  ANTS 2010»
15 years 4 months ago
A Subexponential Algorithm for Evaluating Large Degree Isogenies
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between ellip...
David Jao, Vladimir Soukharev