Sciweavers

672 search results - page 101 / 135
» Almost Optimal Dispersers
Sort
View
WG
1993
Springer
14 years 21 days ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
COCO
2010
Springer
144views Algorithms» more  COCO 2010»
14 years 17 days ago
A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan...
ICDCS
2010
IEEE
14 years 16 days ago
LT Network Codes
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
Mary-Luc Champel, Kévin Huguenin, Anne-Mari...
CGI
2004
IEEE
14 years 12 days ago
Consistent Normal Orientation for Polygonal Meshes
In this paper, we propose a new method that can consistently orient all normals of any mesh (if at all possible), while ensuring that most polygons are seen with their front-faces...
Pavel Borodin, Gabriel Zachmann, Reinhard Klein
CHES
2006
Springer
111views Cryptology» more  CHES 2006»
14 years 11 days ago
Cache-Collision Timing Attacks Against AES
This paper describes several novel timing attacks against the common table-driven software implementation of the AES cipher. We define a general attack strategy using a simplified ...
Joseph Bonneau, Ilya Mironov