Page 1

Displaying 1 – 9 of 9

Showing per page

Hausdorff Distances for Searching in Binary Text Images

Andreev, Andrey, Kirov, Nikolay (2009)

Serdica Journal of Computing

This work has been partially supported by Grant No. DO 02-275, 16.12.2008, Bulgarian NSF, Ministry of Education and Science.Hausdorff distance (HD) seems the most efficient instrument for measuring how far two compact non-empty subsets of a metric space are from each other. This paper considers the possibilities provided by HD and some of its modifications used recently by many authors for resemblance between binary text images. Summarizing part of the existing word image matching methods, relied...

Hierarchical text categorization using fuzzy relational thesaurus

Domonkos Tikk, Jae Dong Yang, Sun Lee Bang (2003)

Kybernetika

Text categorization is the classification to assign a text document to an appropriate category in a predefined set of categories. We present a new approach for the text categorization by means of Fuzzy Relational Thesaurus (FRT). FRT is a multilevel category system that stores and maintains adaptive local dictionary for each category. The goal of our approach is twofold; to develop a reliable text categorization method on a certain subject domain, and to expand the initial FRT by automatically added...

High order edge elements on simplicial meshes

Francesca Rapetti (2007)

ESAIM: Mathematical Modelling and Numerical Analysis

Low order edge elements are widely used for electromagnetic field problems. Higher order edge approximations are receiving increasing interest but their definition become rather complex. In this paper we propose a simple definition for Whitney edge elements of polynomial degree higher than one. We give a geometrical localization of all degrees of freedom over particular edges and provide a basis for these elements on simplicial meshes. As for Whitney edge elements of degree one, the basis is...

Homology of representable sets

Marian Mrozek, Bogdan Batko (2010)

Annales Polonici Mathematici

We generalize the notion of cubical homology to the class of locally compact representable sets in order to propose a new convenient method of reducing the complexity of a set while computing its homology.

Currently displaying 1 – 9 of 9

Page 1