Daniel Milan
A Comparison of the Generalized minC combination and the Hybrid DSm combination Rules
In: Advances and Applications od DSmT for Information Fusion, (Ed. Smarandache F.), Volume: II, American Research Press, 2006, pp. 113-129.
ISBN: 1-59973-000-6
Daniel Milan
Classical Combination Rules Generalized to DMs Hyper-Power Sets and their Comparison with the Hybrid DSm rule
In: Advances and Applications od DSmT for Information Fusion, (Ed. Smarandache F.), Volume: II, American Research Press, 2006, pp. 89-112.
ISBN: 1-59973-000-6
Hájek Petr
What does Mathematical Fuzzy Logic Offer to Description Logic?
In: Fuzzy Logic and the Semantic Web, (Ed. Sanchez E.), Elsevier, 2006.
ISBN: 0-444-51948-3
Continuous t-norm based fuzzy predicate logic is surveyed as a generalization of classical predicate logic; then a kind of fuzzy description logic based on our fuzzy predicate logic is briefly described as a powerful but still decidable formal system of description logic dealing with vague (imprecise) concepts.
Pokorný Jaroslav, Reschke J.
Exporting relational data into a native XML store
In: Advances in Information Systems Development - Bridging the Gap between Academia and Industry, (Ed. A.G. Nilsson et al), Volume: 2, Springer Verlag, 2006, pp. 807-818.
ISBN: 0-387-30834-2
Vojtáš Peter
Fuzzy Logic Aggregation for Semantic Web Search for the Best Answer
In: Fuzzy Logic and the Semantic Web, (Ed. Sanchez E.), Elsevier, 2006.
ISBN: 0-444-51948-3
Zezula Pavel, Dohnal Vlastislav, Novák David
Towards Scalability of Similarity Searching
In: Global Data Management, (Ed. Baldoni R., Cortese G., Davide F., Melpignano A.), Volume: 8 of Emerging Communication: Studies in New Technologies and Practices in Communication, IOS Press, Amsterdam, The Netherlands, 2006.
ISBN: 1-58603-629-7
With the increasing number of applications that base searching on similarity rather than on exact matching, novel index structures are needed to speedup execution of similarity queries. An important stream of research in this direction uses the metric space as a model of similarity. We explain the principles and survey the most important representatives of index structures. We put most emphasis on distributed similarity search architectures which try to solve the difficult problem of scalability of similarity searching. The actual achievements are demonstrated by practical experiments. Future research directions are outlined in the conclusions.