Sciweavers

89 search results - page 9 / 18
» A Characterization of the Language Classes Learnable with Co...
Sort
View
ITA
2007
101views Communications» more  ITA 2007»
13 years 7 months ago
Learning tree languages from text
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
Henning Fernau
ICDT
2011
ACM
242views Database» more  ICDT 2011»
12 years 11 months ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu
COLT
2007
Springer
14 years 2 months ago
U-Shaped, Iterative, and Iterative-with-Counter Learning
This paper solves an important problem left open in the literature by showing that U-shapes are unnecessary in iterative learning. A U-shape occurs when a learner first learns, t...
John Case, Samuel E. Moelius
ECCC
2010
124views more  ECCC 2010»
13 years 8 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
ICDE
2006
IEEE
146views Database» more  ICDE 2006»
14 years 1 months ago
Supporting Predicate-Window Queries in Data Stream Management Systems
The window query model is widely used in data stream management systems where the focus of a continuous query is limited to a set of the most recent tuples. In this dissertation, ...
Thanaa M. Ghanem