Sciweavers

533 search results - page 74 / 107
» The Computational Complexity of Sensitivity Analysis and Par...
Sort
View
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
14 years 8 months ago
Constructing non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
CORR
2004
Springer
90views Education» more  CORR 2004»
13 years 7 months ago
Non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
CIKM
2009
Springer
14 years 2 months ago
Reducing the risk of query expansion via robust constrained optimization
We introduce a new theoretical derivation, evaluation methods, and extensive empirical analysis for an automatic query expansion framework in which model estimation is cast as a r...
Kevyn Collins-Thompson
BMCBI
2008
97views more  BMCBI 2008»
13 years 8 months ago
Quantitative analysis of numerical solvers for oscillatory biomolecular system models
Background: This article provides guidelines for selecting optimal numerical solvers for biomolecular system models. Because various parameters of the same system could have drast...
Chang F. Quo, May D. Wang

Publication
511views
15 years 5 months ago
Modeling Transit Trip Time using Archived Bus Dispatch System Data.
Transit travel time and operating speed influence service attractiveness, operating cost, and system efficiency. The objective of this paper is to estimate the values of parameters...
R. L. Bertini, A. M. El-Geneidy