Sciweavers

19320 search results - page 108 / 3864
» On the complexity of computing determinants
Sort
View
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
15 years 8 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
SAC
2006
ACM
15 years 10 months ago
Service-oriented grid computation for large-scale parameter estimation in complex environmental modeling
Complex environmental modeling often involves a large number of unknown physical and ecological parameters. Parameter estimation is one of the most difficult steps in many modelin...
Kejing He, Shoubin Dong, Li Zheng
ICCS
2005
Springer
15 years 10 months ago
Computational Complexity and Distributed Execution in Water Quality Management
Abstract. Modeling is considered an inherent part of design, operation and optimization of Water Quality Systems. Models are used for running so-called Virtual Experiments, such as...
Maria Chtepen, Filip H. A. Claeys, Bart Dhoedt, Pe...
SAC
2008
ACM
15 years 4 months ago
Computational methods for complex stochastic systems: a review of some alternatives to MCMC
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
Paul Fearnhead
ECAL
2007
Springer
15 years 10 months ago
Detecting Non-trivial Computation in Complex Dynamics
Abstract. We quantify the local information dynamics at each spatiotemporal point in a complex system in terms of each element of computation: information storage, transfer and mod...
Joseph T. Lizier, Mikhail Prokopenko, Albert Y. Zo...