2610 search results - page 425 / 522 » Computational Probabilistic Non-interference |
109
Voted
CORR
2008
Springer
15 years 21 days ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
ENTCS
2008
15 years 21 days ago
2008
Progress, Extended Abstract) Philippe Jorrand1 Simon Perdrix2 Leibniz Laboratory IMAG-INPG Grenoble, France The aim of this paper is to introduce a general model of quantum comput...
BIB
2006
15 years 20 days ago
2006
One of the major goals of computational sequence analysis is to find sequence similarities, which could serve as evidence of structural and functional conservation, as well as of ...
CGF
2006
15 years 20 days ago
2006
We present the Optimizing Control Variate (OCV) estimator, a new estimator for Monte Carlo rendering. Based upon a deterministic sampling framework, OCV allows multiple importance...
117
Voted
CORR
2006
Springer
15 years 20 days ago
2006
Springer
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...