Sciweavers

2474 search results - page 7 / 495
» Learning Languages in a Union
Sort
View
PODS
2010
ACM
170views Database» more  PODS 2010»
14 years 17 days ago
Simplifying XML schema: single-type approximations of regular tree languages
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
Wouter Gelade, Tomasz Idziaszek, Wim Martens, Fran...
INFORMATICALT
1998
101views more  INFORMATICALT 1998»
13 years 7 months ago
Language Egineering in Lithuania
Language engineering encompassing natural language processing and speech processing became very important for a development of every nation in multilingual Europe. After the Counci...
Joana Lipeikiene, Antanas Lipeika
DEDS
2002
85views more  DEDS 2002»
13 years 7 months ago
A General Architecture for Decentralized Supervisory Control of Discrete-Event Systems
Abstract. We consider a generalized form of the conventional decentralized control architecture for discreteevent systems where the control actions of a set of supervisors can be `...
Tae-Sic Yoo, Stéphane Lafortune
COLT
2000
Springer
13 years 12 months ago
Computable Shell Decomposition Bounds
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves suc...
John Langford, David A. McAllester
SIAMCOMP
1998
86views more  SIAMCOMP 1998»
13 years 7 months ago
Exact Learning of Discretized Geometric Concepts
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldm...