Sciweavers

74 search results - page 10 / 15
» Conceptual Graph Rules and Equivalent Rules: A Synthesis
Sort
View
87
Voted
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
15 years 10 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
ATVA
2010
Springer
142views Hardware» more  ATVA 2010»
14 years 7 months ago
On Scenario Synchronization
: Narrowing the wide conceptual gap between problem and implementation domains is considered a significant factor within software engineering. Currently, such a relation is often o...
Duc-Hanh Dang, Anh-Hoang Truong, Martin Gogolla
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 1 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
ICFP
2005
ACM
15 years 9 months ago
The anatomy of a loop: a story of scope and control
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...
Olin Shivers
IWCLS
2007
Springer
15 years 3 months ago
On Lookahead and Latent Learning in Simple LCS
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
Larry Bull