Sciweavers

5 search results - page 1 / 1
» On the number of directions determined by a pair of function...
Sort
View
JCT
2008
67views more  JCT 2008»
13 years 4 months ago
On the number of directions determined by a pair of functions over a prime field
A three-dimensional analogue of the classical direction problem is proposed and an asymptotically sharp bound for the number of directions determined by a nonplanar set in AG(3, p)...
Simeon Ball, András Gács, Pét...
DCC
2008
IEEE
14 years 4 months ago
On the graph of a function in many variables over a finite field
Some improved bounds on the number of directions not determined by a point set in the affine space AG(k, q) are presented. More precisely, if there are more than pe (q -1) directio...
Simeon Ball
IJNSEC
2010
324views more  IJNSEC 2010»
12 years 11 months ago
Computing the Modular Inverse of a Polynomial Function over GF(2P) Using Bit Wise Operation
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
Rajaram Ramasamy, Amutha Prabakar Muniyandi
CGF
2008
124views more  CGF 2008»
13 years 5 months ago
Fast Soft Self-Shadowing on Dynamic Height Fields
We present a new, real-time method for rendering soft shadows from large light sources or lighting environments on dynamic height fields. The method first computes a horizon map f...
John Snyder, Derek Nowrouzezahrai
FOIKS
2008
Springer
14 years 1 months ago
Cost-minimising strategies for data labelling : optimal stopping and active learning
Supervised learning deals with the inference of a distribution over an output or label space $\CY$ conditioned on points in an observation space $\CX$, given a training dataset $D$...
Christos Dimitrakakis, Christian Savu-Krohn