Sciweavers

1391 search results - page 154 / 279
» Complexity Limitations on Quantum Computation
Sort
View
ICPPW
2005
IEEE
14 years 1 months ago
Factoring Solution Sets of Polynomial Systems in Parallel
We report on a £rst parallel implementation of a recent algorithm to factor positive dimensional solution sets of polynomial systems. As the algorithm uses homotopy continuation,...
Anton Leykin, Jan Verschelde
EUROPKI
2004
Springer
14 years 1 months ago
On the Use of Weber Polynomials in Elliptic Curve Cryptography
Abstract. In many cryptographic applications it is necessary to generate elliptic curves (ECs) with certain security properties. These curves are commonly constructed using the Com...
Elisavet Konstantinou, Yannis C. Stamatiou, Christ...
SIGGRAPH
2010
ACM
14 years 16 days ago
3D modeling with silhouettes
We present a new sketch-based modeling approach in which models are interactively designed by drawing their 2D silhouettes from different views. The core idea of our paper is to l...
Alec Rivers, Frédo Durand, Takeo Igarashi
IEEEPACT
1999
IEEE
14 years 10 days ago
Containers on the Parallelization of General-Purpose Java Programs
Automatic parallelization of general-purpose programs is still not possible in general in the presence of irregular data structures and complex control-flows. One promising strate...
Peng Wu, David A. Padua
IPPS
1998
IEEE
14 years 9 days ago
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot