Sciweavers

164 search results - page 7 / 33
» On Class Group Computations Using the Number Field Sieve
Sort
View
ASIACRYPT
2006
Springer
14 years 9 days ago
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe...
CVPR
2006
IEEE
14 years 10 months ago
Solving Markov Random Fields using Second Order Cone Programming Relaxations
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
CE
2008
86views more  CE 2008»
13 years 8 months ago
Computer game design: Opportunities for successful learning
Developing children as successful learners is a key aim of A Curriculum for Excellence in Scotland. This paper presents qualitative results from an eight week exploratory field st...
Judy Robertson, Cathrin Howells
STOC
2002
ACM
126views Algorithms» more  STOC 2002»
14 years 8 months ago
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...
Sean Hallgren
HPDC
1999
IEEE
14 years 26 days ago
The Cactus Computational Toolkit and using Distributed Computing to Collide Neutron Stars
We are developing a system for collaborative research and development for a distributed group of researchers at different institutions around the world. In a new paradigm for coll...
Gabrielle Allen, Tom Goodale, Joan Massó, E...