4895 search results - page 603 / 979 » Functional Quantum Programming |
176
click to vote
TCS
2008
15 years 6 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
134
click to vote
TNN
2008
15 years 6 months ago
2008
Prior knowledge over general nonlinear sets is incorporated into nonlinear kernel classification problems as linear constraints in a linear program. The key tool in this incorpora...
165
click to vote
AUTOMATICA
2004
15 years 6 months ago
2004
In this paper, we consider a deterministic timed continuous Petri net model where conflicts at places are solved by using stationary routing parameters. We show how to compute the...
169
click to vote
ENTCS
2002
15 years 6 months ago
2002
This paper introduces coalgebraic monads as a unified model of term algebras covering fundamental examples such as initial algebras, final coalgebras, rational terms and term grap...
169
click to vote
JCB
2000
15 years 6 months ago
2000
We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The p...