Sciweavers

561 search results - page 16 / 113
» Using number fields to compute logarithms in finite fields
Sort
View
DCC
2004
IEEE
14 years 8 months ago
Periodicity and Correlation Properties of d-FCSR Sequences
A d-feedback-with-carry shift register (d-FCSR) is a finite state machine, similar to a linear feedback shift register, in which a small amount of memory and a delay (by d-clock c...
Mark Goresky, Andrew Klapper
ALENEX
2003
139views Algorithms» more  ALENEX 2003»
13 years 9 months ago
Interpolation over Light Fields with Applications in Computer Graphics
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
F. Betul Atalay, David M. Mount
ANTS
2006
Springer
105views Algorithms» more  ANTS 2006»
14 years 6 days ago
A Modular Method for Computing the Splitting Field of a Polynomial
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
Guénaël Renault, Kazuhiro Yokoyama
ICPR
2004
IEEE
14 years 9 months ago
Vector Field Smoothing Via Heat Flow
In this paper, we develop a new method for recovering and smoothing fields of surface normals in shape-fromshading. We show how transform the problem of recovering surface normals...
Antonio Robles-Kelly, Edwin R. Hancock
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 5 months ago
Algorithms for ray class groups and Hilbert class fields
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
Sean Hallgren, Kirsten Eisentraeger