3604 search results - page 26 / 721 » All Common Subsequences |
ICCS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We have been witnessing an explosion of user involvement in knowledge creation, publication and access both from within and between organisations. This is partly due to t...
IPL
2007
13 years 8 months ago
2007
In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algo...
CLEF
2006
Springer
14 years 6 days ago
2006
Springer
We describe a method for recognizing textual entailment that uses the length of the longest common subsequence (LCS) between two texts as its decision criterion. Rather than requi...
CATA
2006
13 years 10 months ago
2006
The paper presents a load balancing method for some CGM (Coarse-Grained Multicomputer) algorithms. This method can be applied on different dynamic programming problems such as: Lo...
DLOG
2008
13 years 10 months ago
2008
Least Common Subsumers in Description Logics have shown their usefulness for discovering commonalities among all concepts of a collection. Several applications are nevertheless foc...