Sciweavers

729 search results - page 5 / 146
» A Transitive Closure Based Algorithm for Test Generation
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
Combining hierarchical clusterings using min-transitive closure
In the past, clusterings combination approaches are based on “flat” clustering algorithms, i.e. algorithms that operate on non-hierarchical clustering schemes. These approache...
Abdolreza Mirzaei, Mohammad Rahmati
DLOG
2011
12 years 11 months ago
Extracting Finite Sets of Entailments from OWL Ontologies
The canonical standard description logic reasoning service is classification, that is, the generation of the set of atomic subsumptions which are entailed by some ontology. While ...
Samantha Bail, Bijan Parsia, Ulrike Sattler
CAV
2008
Springer
96views Hardware» more  CAV 2008»
13 years 9 months ago
Implied Set Closure and Its Application to Memory Consistency Verification
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
Surender Baswana, Shashank K. Mehta, Vishal Powar
ILP
2005
Springer
14 years 1 months ago
Online Closure-Based Learning of Relational Theories
Online learning algorithms such as Winnow have received much attention in Machine Learning. Their performance degrades only logarithmically with the input dimension, making them us...
Frédéric Koriche
CIKM
2010
Springer
13 years 6 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil