Sciweavers

541 search results - page 31 / 109
» Factoring Solution Sets of Polynomial Systems in Parallel
Sort
View
EUROCRYPT
2012
Springer
13 years 2 months ago
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
Jean-Charles Faugère, Ludovic Perret, Chris...
COCO
2009
Springer
98views Algorithms» more  COCO 2009»
15 years 6 months ago
Extractors for Varieties
We study the task of randomness extraction from sources which are distributed uniformly on an unknown algebraic variety. In other words, we are interested in constructing a functi...
Zeev Dvir
ASAP
2004
IEEE
171views Hardware» more  ASAP 2004»
15 years 3 months ago
CHARMED: A Multi-Objective Co-Synthesis Framework for Multi-Mode Embedded Systems
In this paper, we present a modular co-synthesis framework called CHARMED that solves the problem of hardware-software co-synthesis of periodic, multi-mode, distributed, embedded ...
Vida Kianzad, Shuvra S. Bhattacharyya
JPDC
2008
217views more  JPDC 2008»
14 years 11 months ago
Parallel techniques for information extraction from hyperspectral imagery using heterogeneous networks of workstations
Recent advances in space and computer technologies are revolutionizing the way remotely sensed data is collected, managed and interpreted. In particular, NASA is continuously gath...
Antonio J. Plaza
PODC
2010
ACM
15 years 1 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer