414 search results - page 18 / 83 » On discrete norms of polynomials |
COCO
2003
Springer
14 years 3 months ago
2003
Springer
In this paper we give new extremal bounds on polynomial threshold function (PTF) representations of Boolean functions. Our results include the following: • Almost every Boolean ...
SODA
2012
ACM
12 years 8 days ago
2012
ACM
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has n...
ADCM
2000
13 years 9 months ago
2000
We introduce a class of polynomial frames suitable for analyzing data on the surface of the unit sphere of a Euclidean space. Our frames consist of polynomials, but are well local...
TNN
2008
13 years 9 months ago
2008
Abstract--Plenty of methods have been proposed in order to discover latent variables (features) in data sets. Such approaches include the principal component analysis (PCA), indepe...
DCC
2005
IEEE
14 years 9 months ago
2005
IEEE
Motivated by the use of frames for robust transmission over the Internet, we present a first systematic construction of real tight frames with maximum robustness to erasures. We a...