Sciweavers

114 search results - page 13 / 23
» Mind Change Complexity of Learning Logic Programs
Sort
View
CVPR
2008
IEEE
14 years 2 months ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie
JMLR
2012
11 years 10 months ago
Online Incremental Feature Learning with Denoising Autoencoders
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
Guanyu Zhou, Kihyuk Sohn, Honglak Lee
EPIA
2003
Springer
14 years 23 days ago
An Evolvable Rule-Based E-mail Agent
The Semantic Web is a “living organism”, which combines autonomously evolving data sources/knowledge repositories. This dynamic character of the Semantic Web requires (declarat...
José Júlio Alferes, Antonio Brogi, J...
MICRO
2006
IEEE
84views Hardware» more  MICRO 2006»
14 years 1 months ago
Reunion: Complexity-Effective Multicore Redundancy
To protect processor logic from soft errors, multicore redundant architectures execute two copies of a program on separate cores of a chip multiprocessor (CMP). Maintaining identi...
Jared C. Smolens, Brian T. Gold, Babak Falsafi, Ja...
AAAI
1994
13 years 9 months ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood