Sciweavers

263 search results - page 14 / 53
» Splitting of Learnable Classes
Sort
View
ALT
1997
Springer
13 years 11 months ago
Synthesizing Noise-Tolerant Language Learners
An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of languages (by definition) generat...
John Case, Sanjay Jain, Arun Sharma
TIT
2011
152views more  TIT 2011»
13 years 1 months ago
Fast Exponentiation Using Split Exponents
Abstract—We propose a new method to speed up discrete logarithm (DL)-based cryptosystems by considering a new variant of the DL problem, where the exponents are formed as e1 + α...
Jung Hee Cheon, Stanislaw Jarecki, Taekyoung Kwon,...
IJCAI
1993
13 years 8 months ago
Learning Decision Lists over Tree Patterns and Its Application
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
Satoshi Kobayashi, Koichi Hori, Setsuo Ohsuga
JMLR
2010
134views more  JMLR 2010»
13 years 2 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
COLT
2001
Springer
13 years 12 months ago
On Using Extended Statistical Queries to Avoid Membership Queries
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
Nader H. Bshouty, Vitaly Feldman