2766 search results - page 313 / 554 » Algorithms for trigonometric polynomials |
178
click to vote
ASAP
2004
IEEE
15 years 8 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
122
click to vote
IPCO
2007
15 years 6 months ago
2007
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
133
click to vote
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
146
Voted
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
147
click to vote
SGP
2003
15 years 6 months ago
2003
Point sets become an increasingly popular shape representation. Most shape processing and rendering tasks require the approximation of a continuous surface from the point data. We...