967 search results - page 47 / 194 » Building a Calculus of Data Structures |
TABLEAUX
2009
Springer
14 years 2 months ago
2009
Springer
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...
AIPS
2009
13 years 8 months ago
2009
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
BMCBI
2006
13 years 7 months ago
2006
Background: In sequence analysis the multiple alignment builds the fundament of all proceeding analyses. Errors in an alignment could strongly influence all succeeding analyses an...
ISDA
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we propose an algorithm and data structure for computing the term contributed frequency (tcf) for all N-grams in a text corpus. Although term frequency is one of th...