3454 search results - page 105 / 691 » Modern computer algebra |
139
click to vote
FOCS
2009
IEEE
16 years 28 days ago
2009
IEEE
We give an explicit construction of an -biased set over k bits of size O k 2 log(1/ ) 5/4 . This improves upon previous explicit constructions when is roughly (ignoring logarith
122
click to vote
PPAM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present the way in which we adapt data and computations to the underlying memory hierarchy by means of a hierarchical data structure known as hypermatrix. The applicat...
140
click to vote
AMDO
2008
Springer
15 years 8 months ago
2008
Springer
This paper presents a method of interpolating between two or more general displacements (rotation and translation). The resulting interpolated path is smooth and possesses a number...
173
click to vote
CIDR
2003
15 years 7 months ago
2003
Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
155
click to vote
FCT
2009
Springer
16 years 22 days ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...