276 search results - page 6 / 56 » Quantifying Homology Classes |
116
Voted
AIML
2006
15 years 3 months ago
2006
Bisimulation quantifiers are a natural extension of modal logics. They preserve the bisimulation invariance of modal logic, while allowing monadic second-order expressivity. Unfort...
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
In this work we present a new string similarity feature, the sparse spatial sample (SSS). An SSS is a set of short substrings at specific spatial displacements contained in the or...
110
click to vote
IJDMB
2008
15 years 1 months ago
2008
: Computational classification of proteins using methods such as string kernels and Fisher-SVM has demonstrated great success. However, the resulting models do not offer an immedia...
123
click to vote
JPDC
2007
15 years 1 months ago
2007
In this paper, we address the problem of multiple sequence alignment (MSA) for handling very large number of proteins sequences on mesh-based multiprocessor architectures. As the ...
125
click to vote
FUIN
2010
14 years 11 months ago
2010
We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of fini...