2693 search results - page 184 / 539 » On Computing Complex Navigation Functions |
175
click to vote
JOC
2006
15 years 6 months ago
2006
We present an algorithm to compute the zeta function of an arbitrary hyperelliptic curve over a finite field Fq of characteristic 2, thereby extending the algorithm of Kedlaya for ...
159
click to vote
IJCAI
1997
15 years 7 months ago
1997
This paper presents an algorithm for extract ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
201
click to vote
COMPSAC
2011
IEEE
14 years 6 months ago
2011
IEEE
— This paper discusses ongoing research into the development of an original composition portfolio themed on the concept of palimpsests of time and place. The research involves th...
183
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
189
click to vote
JMLR
2010
15 years 1 months ago
2010
Maximum likelihood estimators are often of limited practical use due to the intensive computation they require. We propose a family of alternative estimators that maximize a stoch...