Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Computing the degree of semantic relatedness of words is a key functionality of many language applications such as search, clustering, and disambiguation. Previous approaches to c...
Kira Radinsky, Eugene Agichtein, Evgeniy Gabrilovi...
We present a tool which helps domain experts capture and maintain constraints. The tool displays parts of an ontology (as classes, sub-classes and properties) in the form of a tree...
Suraj Ajit, Derek H. Sleeman, David W. Fowler, Dav...
In this paper, we present a novel methodology to detect and recognize objects in cluttered scenes by proposing boosted contextual descriptors of landmarks in a framework of multi-...
Abstract. The algorithms dealing with the incorporation of new knowledge in an ontology (ontology evolution) often share a rather standard process of dealing with changes. This pro...
George Konstantinidis, Giorgos Flouris, Grigoris A...