Sciweavers

338 search results - page 61 / 68
» On the Complexity of Termination Inference for Processes
Sort
View
BMCBI
2011
14 years 4 months ago
Logical Development of the Cell Ontology
Background: The Cell Ontology (CL) is an ontology for the representation of in vivo cell types. As biological ontologies such as the CL grow in complexity, they become increasingl...
Terrence F. Meehan, Anna Maria Masci, Amina Abdull...
82
Voted
EVOW
2007
Springer
15 years 1 months ago
Dinucleotide Step Parameterization of Pre-miRNAs Using Multi-objective Evolutionary Algorithms
MicroRNAs (miRNAs) form a large functional family of small noncoding RNAs and play an important role as posttranscriptional regulators, by repressing the translation of mRNAs. Rece...
Jin-Wu Nam, In-Hee Lee, Kyu Baek Hwang, Seong-Bae ...
ICGI
2010
Springer
14 years 8 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
13 years 2 days ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor
82
Voted
ICSE
2008
IEEE-ACM
15 years 10 months ago
Symbolic mining of temporal specifications
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...
Mark Gabel, Zhendong Su