Sciweavers

152 search results - page 16 / 31
» Constructive Proofs of Concentration Bounds
Sort
View
DCC
2004
IEEE
14 years 7 months ago
Parameter Inequalities for Orthogonal Arrays with Mixed Levels
An important question in the construction of orthogonal arrays is what the minimal size of an array is when all other parameters are fixed. In this paper, we will provide a genera...
Wiebke S. Diestelkamp
CSR
2011
Springer
12 years 11 months ago
The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
Dmitry Itsykson, Dmitry Sokolov
CGF
1998
101views more  CGF 1998»
13 years 7 months ago
Rapid and Accurate Contact Determination between Spline Models using ShellTrees
In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...
Shankar Krishnan, M. Gopi, Ming C. Lin, Dinesh Man...
FOCS
2008
IEEE
14 years 2 months ago
Spherical Cubes and Rounding in High Dimensions
What is the least surface area of a shape that tiles Rd under translations by Zd ? Any such shape must have volume 1 and hence surface area at least that of the volume-1 ball, nam...
Guy Kindler, Ryan O'Donnell, Anup Rao, Avi Wigders...
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 7 months ago
New Sequences Design from Weil Representation with Low Two-Dimensional Correlation in Both Time and Phase Shifts
For a given prime p, a new construction of families of the complex valued sequences of period p with efficient implementation is given by applying both multiplicative characters a...
Zilong Wang, Guang Gong