Sciweavers

237 search results - page 24 / 48
» Algorithms for Exponentiation in Finite Fields
Sort
View
STOC
2002
ACM
124views Algorithms» more  STOC 2002»
14 years 8 months ago
Clairvoyant scheduling of random walks
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
Péter Gács
VIS
2004
IEEE
195views Visualization» more  VIS 2004»
14 years 8 months ago
Flow Field Clustering via Algebraic Multigrid
We present a novel multiscale approach for flow visualization. We define a local alignment tensor that encodes a measure for alignment to the direction of a given flow field. This...
Michael Griebel, Tobias Preußer, Martin Rump...
ASAP
2010
IEEE
315views Hardware» more  ASAP 2010»
13 years 5 months ago
A compact FPGA-based architecture for elliptic curve cryptography over prime fields
Abstract--This paper proposes an FPGA-based applicationspecific elliptic curve processor over a prime field. This research targets applications for which compactness is more import...
Jo Vliegen, Nele Mentens, Jan Genoe, An Braeken, S...
ANTS
2008
Springer
106views Algorithms» more  ANTS 2008»
13 years 9 months ago
Computing in Component Groups of Elliptic Curves
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
J. E. Cremona
CVPR
2010
IEEE
13 years 10 months ago
Ray Markov Random Fields for Image-Based 3D Modeling: Model and Efficient Inference
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...
Shubao Liu, David Cooper