1552 search results - page 177 / 311 » On the Complexity of Constant Propagation |
155
click to vote
MOC
1998
15 years 6 months ago
1998
We show that the multiple zeta sum: ζ(s1, s2, ..., sd) = n1>n2>...>nd 1 ns1 1 ns2 2 ...n sd d , for positive integers si with s1 > 1, can always be written as a finit...
176
click to vote
TC
2002
15 years 6 months ago
2002
This article presents simple and highly regular architectures for finite field multipliers using a redundant representation. The basic idea is to embed a finite field into a cyclo...
168
click to vote
MICS
2007
15 years 6 months ago
2007
Abstract. We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ε is c1ε...
168
click to vote
IPL
2010
15 years 5 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
218
click to vote
RTS
2010
15 years 4 months ago
2010
Reader preference, writer preference, and task-fair reader-writer locks are shown to cause undue blocking in multiprocessor real-time systems. Phase-fair reader writer locks, a ne...