Sciweavers

3758 search results - page 23 / 752
» A Complete Subsumption Algorithm
Sort
View
JAPLL
2010
131views more  JAPLL 2010»
13 years 6 months ago
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...
Willem Conradie, Valentin Goranko, Dimiter Vakarel...
FSKD
2005
Springer
90views Fuzzy Logic» more  FSKD 2005»
14 years 1 months ago
Direct Candidates Generation: A Novel Algorithm for Discovering Complete Share-Frequent Itemsets
The value of the itemset share is one way of evaluating the magnitude of an itemset. From business perspective, itemset share values reflect more the significance of itemsets for m...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
IPL
2006
83views more  IPL 2006»
13 years 7 months ago
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two ...
Claudson F. Bornstein, Celina M. Herrera de Figuei...
ASIACRYPT
2003
Springer
14 years 23 days ago
A Complete and Explicit Security Reduction Algorithm for RSA-Based Cryptosystems
In this paper, we introduce a conceptually very simple and demonstrative algo
Kaoru Kurosawa, Katja Schmidt-Samoa, Tsuyoshi Taka...