Sciweavers

73 search results - page 12 / 15
» The Complexity of Learning Concept Classes with Polynomial G...
Sort
View
PODS
2010
ACM
170views Database» more  PODS 2010»
14 years 18 days ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...
JAIR
2006
87views more  JAIR 2006»
13 years 7 months ago
Fault Tolerant Boolean Satisfiability
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
Amitabha Roy
PAMI
2011
13 years 2 months ago
Multiple Kernel Learning for Dimensionality Reduction
—In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. The resulting ...
Yen-Yu Lin, Tyng-Luh Liu, Chiou-Shann Fuh
FLAIRS
2008
13 years 9 months ago
Learning in the Lexical-Grammatical Interface
Children are facile at both discovering word boundaries and using those words to build higher-level structures in tandem. Current research treats lexical acquisition and grammar i...
Tom Armstrong, Tim Oates
SAC
2006
ACM
14 years 1 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