Sciweavers

695 search results - page 60 / 139
» The structure of intrinsic complexity of learning
Sort
View
CIDM
2007
IEEE
13 years 11 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
AFPAC
2000
Springer
341views Mathematics» more  AFPAC 2000»
14 years 18 hour ago
An Associative Perception-Action Structure Using a Localized Space Variant Information Representation
Abstract. Most of the processing in vision today uses spatially invariant operations. This gives efficient and compact computing structures, with the conventional convenient separa...
Gösta H. Granlund
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
14 years 8 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
ISMVL
1997
IEEE
134views Hardware» more  ISMVL 1997»
13 years 12 months ago
Functional Decomposition of MVL Functions Using Multi-Valued Decision Diagrams
In this paper, the minimization of incompletely specified multi-valued functions using functional decomposition is discussed. From the aspect of machine learning, learning sample...
Craig M. Files, Rolf Drechsler, Marek A. Perkowski
ICML
2006
IEEE
14 years 8 months ago
Learning hierarchical task networks by observation
Knowledge-based planning methods offer benefits over classical techniques, but they are time consuming and costly to construct. There has been research on learning plan knowledge ...
Negin Nejati, Pat Langley, Tolga Könik