1418 search results - page 111 / 284 » Schema polynomials and applications |
158
click to vote
IEEECGIV
2009
IEEE
16 years 28 days ago
2009
IEEE
—There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former m...
161
click to vote
ASIACRYPT
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
168
click to vote
RANDOM
1997
Springer
15 years 10 months ago
1997
Springer
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
196
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
157
click to vote
JUCS
2006
15 years 6 months ago
2006
: A sequence of increasing translation invariant subspaces can be defined by the Haar-system (or generally by wavelets). The orthogonal projection to the subspaces generates a deco...