Sciweavers

60 search results - page 1 / 12
» Lower bounds for designs in symmetric spaces
Sort
View
ECCC
2010
89views more  ECCC 2010»
13 years 5 months ago
Lower bounds for designs in symmetric spaces
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
Noa Eidelstein, Alex Samorodnitsky
DAM
2007
84views more  DAM 2007»
13 years 4 months ago
Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
Vera Kurková, Marcello Sanguineti
STACS
1999
Springer
13 years 9 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
SDM
2007
SIAM
133views Data Mining» more  SDM 2007»
13 years 6 months ago
On Point Sampling Versus Space Sampling for Dimensionality Reduction
In recent years, random projection has been used as a valuable tool for performing dimensionality reduction of high dimensional data. Starting with the seminal work of Johnson and...
Charu C. Aggarwal
ACISP
1997
Springer
13 years 9 months ago
New Lower Bounds on Nonlinearity and a Class of Highly Nonlinear Functions
Abstract. Highly nonlinear Boolean functions occupy an important position in the design of secure block as well as stream ciphers. This paper proves two new lower bounds on the non...
Xian-Mo Zhang, Yuliang Zheng