Low-Resource Speech Recognition of 500-Word Vocabularies
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Motivated by ideas from the study of abstract data types, we show how to interpret non-well-founded sets as fixed points of continuous transformations of an initial continuous algebra. We conisder a preordered structure closely related to the set HF of well-founded, hereditarily finite sets. By taking its ideal completion, we obtain an initial continuous algebra in which we are able to solve all of the usual systems of equations that characterize hereditarily finite, non-well-founded sets. In this way, we are able to obtain a structure which is isomorphic to HF1, the non-well founded analog of HF. © 1991.
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Lixi Zhou, Jiaqing Chen, et al.
VLDB
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010