Sciweavers

79 search results - page 11 / 16
» Full Abstraction and the Context Lemma
Sort
View
ICMLA
2009
13 years 6 months ago
Learning Probabilistic Structure Graphs for Classification and Detection of Object Structures
Abstract--This paper presents a novel and domainindependent approach for graph-based structure learning. The approach is based on solving the Maximum Common SubgraphIsomorphism pro...
Johannes Hartz
CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 3 months ago
From IF to BI: a tale of dependence and separation
We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and V¨a¨an¨anen, and their compositional semantics due to Hodges. We show h...
Samson Abramsky, Jouko A. Väänänen
TVCG
2011
100views more  TVCG 2011»
13 years 3 months ago
Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths
—Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place t...
Daniel Archambault, Tamara Munzner, David Auber
SEMWEB
2010
Springer
13 years 3 months ago
A taskonomy for the Semantic Web
The modalities of search and browse dominate current thinking about interaction with the Web. Given the Web's origins as a global hypertext system, it is understandable that t...
Tom Heath
SEMWEB
2010
Springer
13 years 3 months ago
Theoretical foundations and engineering tools for building ontologies as reference conceptual models
Abstract. Perhaps the most fundamental notion underlying the desiderata for a successful Semantic Web is Semantic Interoperability. In this context, ontologies have been more and m...
Giancarlo Guizzardi