28888 search results - page 34 / 5778 » Computability and complexity in analysis |
CMSB
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Probabilistic model checking is a formal verification technique that has been successfully applied to the analysis of systems from a broad range of domains, including sec...
ISSAC
2004
Springer
14 years 1 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
JACM
2000
13 years 7 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
ETVC
2008
13 years 9 months ago
2008
Computational anatomy is an emerging discipline that aims at analyzing and modeling the individual anatomy of organs and their biological variability across a population. The goal ...
BMCBI
2008
13 years 8 months ago
2008
Background: An increasing number of scientific research projects require access to large-scale computational resources. This is particularly true in the biological field, whether ...