Sciweavers

7405 search results - page 837 / 1481
» Computer Graphics
Sort
View
DCC
2005
IEEE
16 years 6 months ago
A Family of Binary (t, m, s)-Nets of Strength 5
(t, m, s)-nets were defined by Niederreiter [6], based on earlier work by Sobol' [7], in the context of quasi-Monte Carlo methods of numerical integration. Formulated in comb...
Jürgen Bierbrauer, Yves Edel
154
Voted
DCC
2005
IEEE
16 years 6 months ago
Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces
Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions (...
Pascale Charpin, Enes Pasalic
DCC
2005
IEEE
16 years 6 months ago
The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments
A v-player whist tournament is a schedule of games, where in each round the v players are partitioned into games of four players each with at most one player left over. In each ga...
Harri Haanpää, Petteri Kaski
DCC
2005
IEEE
16 years 6 months ago
TetStreamer: Compressed Back-to-Front Transmission of Delaunay Tetrahedra Meshes
We use the abbreviations tet and tri for tetrahedron and triangle. TetStreamer encodes a Delaunay tet mesh in a back-to-front visibility order and streams it from a server to a cl...
Urs Bischoff, Jarek Rossignac
DCC
2005
IEEE
16 years 6 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...