๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithmic Computation and Approximation of Semantic Similarity

โœ Scribed by Ana G. Maguitman; Filippo Menczer; Fulya Erdinc; Heather Roinestad; Alessandro Vespignani

Book ID
106567555
Publisher
Springer
Year
2006
Tongue
English
Weight
678 KB
Volume
9
Category
Article
ISSN
1386-145X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Semantical and computational aspects of
Semantical and computational aspects of Horn approximations
โœ Marco Cadoli; Francesco Scarcello ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 152 KB

Selman and Kautz proposed a method, called Horn approximation, for speeding up inference in propositional Knowledge Bases. Their technique is based on the compilation of a propositional formula into a pair of Horn formulae: a Horn Greatest Lower Bound (GLB) and a Horn Least Upper Bound (LUB). In thi

Algorithmic Computation of Flattenings a
Algorithmic Computation of Flattenings and of Modular Deformations
โœ Bernd Martin ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 320 KB

This paper presents an algorithm for the computation of any jet of the flattening stratum of a module over a local algebra based on an obstruction theory for lifting flatness. It is applied to modular deformations of singular germs. Infinitesimal modular deformations of isolated complete intersectio