Sciweavers

846 search results - page 83 / 170
» Transforming structures by set interpretations
Sort
View
AAAI
2008
14 years 10 days ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 10 months ago
A Meta-Programming Approach to Realizing Dependently Typed Logic Programming
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
Zachary Snow, David Baelde, Gopalan Nadathur
ESWA
2006
114views more  ESWA 2006»
13 years 10 months ago
Bankruptcy prediction with neural logic networks by means of grammar-guided genetic programming
The paper demonstrates the efficient use of hybrid intelligent systems for solving the classification problem of bankruptcy. The aim of the study is to obtain classification schem...
Athanasios Tsakonas, Georgios Dounias, Michael Dou...
LOGCOM
2002
142views more  LOGCOM 2002»
13 years 9 months ago
Two Logical Theories of Plan Recognition
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
Wayne Wobcke
PODS
1989
ACM
129views Database» more  PODS 1989»
14 years 2 months ago
The Alternating Fixpoint of Logic Programs with Negation
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
Allen Van Gelder