Sciweavers

3604 search results - page 709 / 721
» Relation rule mining
Sort
View
SPATIALCOGNITION
2000
Springer
13 years 11 months ago
Interactive Layout Generation with a Diagrammatic Constraint Language
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
Christoph Schlieder, Cornelius Hagen
ESWS
2010
Springer
13 years 9 months ago
An Unsupervised Approach for Acquiring Ontologies and RDF Data from Online Life Science Databases
In the Linked Open Data cloud one of the largest data sets, comprising of 2.5 billion triples, is derived from the Life Science domain. Yet this represents a small fraction of the ...
Saqib Mir, Steffen Staab, Isabel Rojas
ASM
2008
ASM
13 years 9 months ago
A First Attempt to Express KAOS Refinement Patterns with Event B
anguage (Event B), hence staying at the same abstraction level. Thus we take advantage from the Event B method: (i) it is possible to use the method during the whole development pr...
Abderrahman Matoussi, Frédéric Gerva...
ASWC
2008
Springer
13 years 9 months ago
Scalable Distributed Ontology Reasoning Using DHT-Based Partitioning
Abstract. Ontology reasoning is an indispensable step to fully exploit the implicit semantics of Semantic Web data. The inherent distribution characteristic of the Semantic Web and...
Qiming Fang, Ying Zhao, Guangwen Yang, Weimin Zhen...
CRYPTO
2008
Springer
92views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Compression from Collisions, or Why CRHF Combiners Have a Long Output
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of th...
Krzysztof Pietrzak