Sciweavers

3890 search results - page 36 / 778
» Computation of unirational fields
Sort
View
MOC
2000
132views more  MOC 2000»
14 years 11 months ago
Lattice computations for random numbers
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...
Raymond Couture, Pierre L'Ecuyer
EUROCAST
1997
Springer
156views Hardware» more  EUROCAST 1997»
15 years 3 months ago
A Computational Model for Visual Size, Location and Movement
The ability to detect object size, location and movement is essential for a visual system in either a biological or man made environment. In this paper we present a model for esti...
Miguel Alemán-Flores, K. Nicholas Leibovic,...
AAECC
2004
Springer
63views Algorithms» more  AAECC 2004»
14 years 11 months ago
Computation of the Decomposition Group of a Triangular Ideal
Abstract. This article describes two algorithms in order to search decomposition groups of ideals of polynomials with coefficients in a perfect field when those ideals are generate...
I. Abdeljaouad-Tej, Sébastien Orange, Gu&ea...
HICSS
2011
IEEE
199views Biometrics» more  HICSS 2011»
14 years 3 months ago
Have IS Researchers Lost Bandura's Self-Efficacy Concept? A Discussion of the Definition and Measurement of Computer Self-Effica
There has been something of an academic debate between proponents of two different kinds of computer self-efficacy: general computer self-efficacy ala Compeau and Higgins on the o...
Jennifer L. Claggett, Dale Goodhue
VLUDS
2010
212views Visualization» more  VLUDS 2010»
14 years 6 months ago
Open Problems in Computational Steering of Massive Parallel Unstructured Grid Based CFD Simulations
Traditionally, analysis of flow fields resulting from computational fluid dynamics (CFD) calculations is a sequential process. The flow area defined by surrounding geometry is tes...
Christian Wagner