325 search results - page 34 / 65 » Remarks on the Schoof-Elkies-Atkin algorithm |
SIGIR
2008
ACM
13 years 9 months ago
2008
ACM
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...
BMCBI
2005
13 years 9 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
TWC
2008
13 years 9 months ago
2008
We consider allocating the transmit powers for a wireless multi-link (N-link) system, in order to maximize the total system throughput under interference and noise impairments, and...
SIGKDD
2002
13 years 9 months ago
2002
Research in secure distributed computation, which was done as part of a larger body of research in the theory of cryptography, has achieved remarkable results. It was shown that n...
IACR
2011
12 years 9 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...