650 search results - page 125 / 130 » On Coalgebras over Algebras |
PLDI
2003
ACM
14 years 24 days ago
2003
ACM
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...
LATIN
2010
Springer
14 years 20 days ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
ICA3PP
2010
Springer
14 years 10 days ago
2010
Springer
Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algo...
STOC
1997
ACM
13 years 11 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
FPCA
1989
13 years 11 months ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...