Sciweavers

257 search results - page 15 / 52
» On the Complexity of Computing Units in a Number Field
Sort
View
ACMSE
2006
ACM
14 years 11 days 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
ICCV
1999
IEEE
14 years 10 months ago
Fluid Motion Recovery by Coupling Dense and Parametric Vector Fields
In this paper we address the problem of estimating and analyzing the motion in image sequences that involve fluid phenomena. In this context standard motion estimation techniques ...
Étienne Mémin, Patrick Pérez
ICIP
2008
IEEE
14 years 10 months ago
Coding-gain-based complexity control for H.264 video encoder
The allowable computational complexity of video encoding is limited in a power-constrained system. Different video frames are associated with different motions and contexts, and s...
Ming-Chen Chien, Zong-Yi Chen, Pao-Chi Chang
JMLR
2010
162views more  JMLR 2010»
13 years 3 months ago
A Surrogate Modeling and Adaptive Sampling Toolbox for Computer Based Design
An exceedingly large number of scientific and engineering fields are confronted with the need for computer simulations to study complex, real world phenomena or solve challenging ...
Dirk Gorissen, Ivo Couckuyt, Piet Demeester, Tom D...
PARLE
1994
14 years 20 days ago
Modelling Photochemical Pollution using Parallel and Distributed Computing Platforms
Scientists are increasingly turning to numerical simulation in order to investigate and model complex environmental systems. Numerical simulation has enormous advantages over labor...
David Abramson, M. Cope, R. McKenzie