Sciweavers

490 search results - page 21 / 98
» Equivalent Keys of HPC
Sort
View
DKE
1998
146views more  DKE 1998»
13 years 8 months ago
A Case study of Automatic Authoring: From a Textbook to a Hyper-Textbook
This paper presents a case-study of automatic construction of a hypertext from a large full-text document. The document we used as input of the automatic authoring process is a we...
Fabio Crestani, Massimo Melucci
SIAMCO
2008
88views more  SIAMCO 2008»
13 years 8 months ago
On Local Transverse Feedback Linearization
Given a control-affine system and a controlled invariant submanifold, we present necessary and sufficient conditions for local feedback equivalence to a system whose dynamics tran...
Christopher Nielsen, Manfredi Maggiore
SIAMCOMP
1998
86views more  SIAMCOMP 1998»
13 years 8 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...
COLT
1994
Springer
14 years 23 days ago
An Optimal Parallel Algorithm for Learning DFA
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
José L. Balcázar, Josep Díaz,...
JCT
2006
77views more  JCT 2006»
13 years 8 months ago
There are uncountably many topological types of locally finite trees
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
Lilian Matthiesen