Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Maria Mateescu

dblp:09/2316 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3Software engineering, systems software and programming languages · 2Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 100%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
markov chain
0.222012
Delayed Continuous-Time Markov Chains for Genetic Regulatory Circuits · CAV 2012
Sliding Window Abstraction for Infinite Markov Chains · CAV 2009
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › markov chain
continuous-time markov chain
0.112012
Delayed Continuous-Time Markov Chains for Genetic Regulatory Circuits · CAV 2012
Bioinformatics and computational biology › gene regulation
gene regulatory network
0.112012
Delayed Continuous-Time Markov Chains for Genetic Regulatory Circuits · CAV 2012
Automated reasoning and model checking
abstraction
0.112009
Sliding Window Abstraction for Infinite Markov Chains · CAV 2009
Automated reasoning and model checking › model checking
infinite-state model checking
0.112009
Sliding Window Abstraction for Infinite Markov Chains · CAV 2009
Bioinformatics and computational biology
stochastic modeling
0.012012
Delayed Continuous-Time Markov Chains for Genetic Regulatory Circuits · CAV 2012

Methods — techniques the papers use, named apart from their topics

continuous-time markov chain · 0.3sliding window abstraction · 0.2
YearPublicationVenuePosition
2013 The Propagation Approach for Computing Biochemical Reaction Networks
abstract
We introduce propagation models (PMs), a formalism able to express several kinds of equations that describe the behavior of biochemical reaction networks. Furthermore, we introduce the propagation abstract data type (PADT), which separates concerns regarding different numerical algorithms for the transient analysis of biochemical reaction networks from concerns regarding their implementation, thus allowing for portable and efficient solutions. The state of a propagation abstract data type is given by a vector that assigns mass values to a set of nodes, and its next operator propagates mass values through this set of nodes. We propose an approximate implementation of the next operator, based on threshold abstraction, which propagates only "significant" mass values and thus achieves a compromise between efficiency and accuracy. Finally, we give three use cases for propagation models: the chemical master equation (CME), the reaction rate equation (RRE), and a hybrid method that combines these two equations. These three applications use propagation models in order to propagate probabilities and/or expected values and variances of the model's variables.
Thomas A. Henzinger, Maria Mateescu
IEEE ACM Trans. Comput. Biol. Bioinform.2
2012 Delayed Continuous-Time Markov Chains for Genetic Regulatory Circuits
Calin C. Guet, Ashutosh Gupta 0001, Thomas A. Henzinger, Maria Mateescu, Ali Sezgin
CAV4
2011 Approximation of event probabilities in noisy cellular processes
Frédéric Didier, Thomas A. Henzinger, Maria Mateescu, Verena Wolf 0001
Theor. Comput. Sci.3
2009 Sliding Window Abstraction for Infinite Markov Chains
Thomas A. Henzinger, Maria Mateescu, Verena Wolf 0001
CAV2