1051 search results - page 12 / 211 » On the Correspondence between Approximations and Similarity |
MLQ
2000
14 years 11 months ago
2000
The connection between similarity logic and the theory of closure operators is examined. Indeed one proves that the consequence relation defined in [14] can be obtained by composin...
ACL
1998
15 years 1 months ago
1998
Rich mark-up can considerably benefit the process of establishing bitext correspondences, that is, the task of providing correct identification and alignment methods for text segm...
KDD
2006
ACM
16 years 3 days ago
2006
ACM
In the On Line Analytical Processing (OLAP) context, exploration of huge and sparse data cubes is a tedious task which does not always lead to efficient results. In this paper, we...
ENTCS
2007
14 years 11 months ago
2007
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
RECOMB
2003
Springer
16 years 7 hour ago
2003
Springer
It is shown that structural similarity between proteins can be decided well with much less information than what is used in common similarity measures. The full C representation c...