Sciweavers

305 search results - page 24 / 61
» Similarity relations in concept lattices
Sort
View
IJIS
2007
93views more  IJIS 2007»
14 years 11 months ago
Perspectives on ontology-based querying
In this paper, we introduce principles for ontology-based querying of information bases. We consider a framework in which a basis ontology over atomic concepts in combination with ...
Rasmus Knappe, Henrik Bulskov, Troels Andreasen
TIT
2002
126views more  TIT 2002»
14 years 11 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy
FOIS
2001
15 years 1 months ago
A note on proximity spaces and connection based mereology
-- Representation theorems for systems of regions have been of interest for some time, and various contexts have been used for this purpose: Mormann [17] has demonstrated the fruit...
Dimiter Vakarelov, Ivo Düntsch, Brandon Benne...
BSL
2006
114views more  BSL 2006»
14 years 12 months ago
Schemata: The Concept of Schema in the History of Logic
Schemata have played important roles in logic since Aristotle's Prior Analytics. The syllogistic figures and moods can be taken to be argument schemata as can the rules of the...
John Corcoran
IFIP12
2007
15 years 1 months ago
Clustering Improves the Exploration of Graph Mining Results
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters