Sciweavers

11160 search results - page 1938 / 2232
» Incompleteness in a General Setting
Sort
View
POPL
2003
ACM
16 years 7 months ago
Pure patterns type systems
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
Gilles Barthe, Horatiu Cirstea, Claude Kirchner, L...
POPL
2003
ACM
16 years 7 months ago
Interprocedural compatibility analysis for static object preallocation
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
Ovidiu Gheorghioiu, Alexandru Salcianu, Martin C. ...
RECOMB
2002
Springer
16 years 7 months ago
From promoter sequence to expression: a probabilistic framework
We present a probabilistic framework that models the process by which transcriptional binding explains the mRNA expression of different genes. Our joint probabilistic model unifie...
Eran Segal, Yoseph Barash, Itamar Simon, Nir Fried...
RECOMB
2002
Springer
16 years 7 months ago
Probabilistic hierarchical clustering for biological data
Biological data, such as gene expression profiles or protein sequences, is often organized in a hierarchy of classes, where the instances assigned to "nearby" classes in...
Eran Segal, Daphne Koller
CADE
2006
Springer
16 years 7 months ago
CEL - A Polynomial-Time Reasoner for Life Science Ontologies
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
Franz Baader, Carsten Lutz, Boontawee Suntisrivara...
« Prev « First page 1938 / 2232 Last » Next »