Sciweavers

3890 search results - page 103 / 778
» Computation of unirational fields
Sort
View
TVCG
1998
197views more  TVCG 1998»
15 years 5 months ago
A New Line Integral Convolution Algorithm for Visualizing Time-Varying Flow Fields
—New challenges on vector field visualization emerge as time-dependent numerical simulations become ubiquitous in the field of computational fluid dynamics (CFD). To visualize da...
Han-Wei Shen, David L. Kao
FOCM
2008
77views more  FOCM 2008»
15 years 6 months ago
Modular Counting of Rational Points over Finite Fields
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
Daqing Wan
TIP
2008
111views more  TIP 2008»
15 years 6 months ago
Unsupervised Bayesian Convex Deconvolution Based on a Field With an Explicit Partition Function
This paper proposes a non-Gaussian Markov field with a special feature: an explicit partition function. To the best of our knowledge, this is an original contribution. Moreover, th...
Jean-François Giovannelli
TOG
2008
124views more  TOG 2008»
15 years 6 months ago
Towards passive 6D reflectance field displays
Traditional flat screen displays present 2D images. 3D and 4D displays have been proposed making use of lenslet arrays to shape a fixed outgoing light field for horizontal or bidi...
Martin Fuchs, Ramesh Raskar, Hans-Peter Seidel, He...
ACMSE
2006
ACM
15 years 10 months ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar