1032 search results - page 93 / 207 » Extended Computation Tree Logic |
ICFP
2000
ACM
15 years 2 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
106
click to vote
ADC
2003
Springer
15 years 3 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
124
click to vote
LPAR
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
103
click to vote
NAR
2011
14 years 24 days ago
2011
The growing availability of complete genomic sequences from diverse species has brought about the need to scale up phylogenomic analyses, including the reconstruction of large col...
BIRD
2008
Springer
14 years 12 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...