Sciweavers

113 search results - page 15 / 23
» Reduction Strategies for Left-Linear Term Rewriting Systems
Sort
View
SAC
2006
ACM
15 years 6 months ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
ENTCS
2008
96views more  ENTCS 2008»
15 years 13 days ago
Maude as a Platform for Designing and Implementing Deep Inference Systems
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
Ozan Kahramanogullari
IDEAS
2009
IEEE
142views Database» more  IDEAS 2009»
15 years 7 months ago
A magic approach to optimizing incremental relational expressions
This paper is concerned with a transformation-based approach to update propagation in an extended version of Codd’s relational algebra which allows for defining derived relatio...
Andreas Behrend
SIGSOFT
2003
ACM
16 years 1 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
PR
2007
129views more  PR 2007»
14 years 12 months ago
EROS: Ensemble rough subspaces
Ensemble learning is attracting much attention from pattern recognition and machine learning domains for good generalization. Both theoretical and experimental researches show tha...
Qinghua Hu, Daren Yu, Zongxia Xie, Xiaodong Li