Sciweavers

1689 search results - page 39 / 338
» Refining abstract interpretations
Sort
View
102
Voted
SAS
2000
Springer
15 years 5 months ago
Tree Schemata and Fair Termination
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...
Laurent Mauborgne
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 2 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
ICDM
2010
IEEE
125views Data Mining» more  ICDM 2010»
14 years 12 months ago
Evolving Ensemble-Clustering to a Feedback-Driven Process
Abstract--Data clustering is a highly used knowledge extraction technique and is applied in more and more application domains. Over the last years, a lot of algorithms have been pr...
Martin Hahmann, Dirk Habich, Wolfgang Lehner
HICSS
1997
IEEE
75views Biometrics» more  HICSS 1997»
15 years 6 months ago
The Voting-Type Technique in the Refinement of Multiple Expert Knowledge
The goal of this paper is to develop methods to handle inconsistent knowledge elicited from multiple sources. Knowledge is represented using predicates that define relationships w...
Seppo Puuronen, Vagan Y. Terziyan
CORR
2010
Springer
173views Education» more  CORR 2010»
14 years 11 months ago
Mining Multi-Level Frequent Itemsets under Constraints
Mining association rules is a task of data mining, which extracts knowledge in the form of significant implication relation of useful items (objects) from a database. Mining multi...
Mohamed Salah Gouider, Amine Farhat