Result 101 to 120 of 150 total
Offspring-annotated probabilistic context-free grammars (English)
ECML Workshop on Learning Contex-Free Grammars, 101-112 (2003).
101
Smoothing techniques for tree-k-grammar-based natural language modeling (English)
IbPRIA, 1057-1065 (2003).
102
Tree $k$-grammar models for natural language modelling and parsing. (English)
Caelli, Terry (ed.) et al., Structural, syntactic, and statistical pattern recognition. Joint IAPR international workshops, SSPR 2002 and SPR 2002, Windsor, Ontario, Canada, August 6‒9, 2002. Proceedings. Berlin: Springer (ISBN 3-540-44011-9). Lect. Notes Comput. Sci. 2396, 56-63 (2002).
103
Stochastic $k$-testable tree languages and applications. (English)
Adriaans, Pieter (ed.) et al., Grammatical inference: Algorithms and applications. 6th international colloquium, ICGI 2002, Amsterdam, the Netherlands, September 23-25, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2484, 199-212 (2002).
104
Incremental construction and maintenance of minimal finite-state automata. (English)
Comput. Linguist. 28, No. 2, 207-216 (2002).
105
Incremental construction and maintenance of minimal finite-state automata (English)
Computational Linguistics 28, No. 2, 207-216 (2002).
106
FSQL: A flexible query language for data mining (English)
ICEIS, 50-56 (2002).
107
Tree k-grammar models for natural language modelling and parsing (English)
SSPR/SPR, 56-63 (2002).
108
Stochastic k-testable tree languages and applications (English)
ICGI, 199-212 (2002).
109
Simple Strategies to Encode Tree Automata in Sigmoid Recursive Neural Networks. (English)
IEEE Transactions on Knowledge and Data Engineering 13, No.02, 148-156 (2001).
110
Modem-based communications using synchronized chaos. (English)
Int. J. Commun. Syst. 14, No.3, 305-317 (2001).
111
Application of a recurrent neural network to space deversity in sDMA and CDMA mobile communication systems. (English)
Neural Comput. Appl. 10, No.2, 136-147 (2001).
112
Using artificial neural network to define fuzzy comparators in FSQL with the criterion of some decision-maker. (English)
Mira, José (ed.) et al., Bio-inspired applications of connectionism. 6th international work-conference on artificial and natural neural networks, IWANN 2001, Granada, Spain, June 13-15, 2001. Proceedings, Part 2. Berlin: Springer. Lect. Notes Comput. Sci. 2085, 587-594 (2001).
113
Finite-state computation in analog neural networks: Steps towards biologically plausible models? (English)
Wermter, Stefan (ed.) et al., Emergent neural computational architectures based on neuroscience. Towards neuroscience-inspired computing. Berlin: Springer. Lect. Notes Comput. Sci. 2036, 480-493 (2001).
114
Stochastic inference of regular tree languages. (English)
Mach. Learn. 44, No.1-2, 185-197 (2001).
115
Linear and nonlinear space diversity combining algorithms over fading channels in TDMA systems. (English)
Int. J. Commun. Syst. 14, No.6, 619-632 (2001).
116
Simple strategies to encode tree automata in Sigmoid recursive neural networks (English)
IEEE Trans. Knowl. Data Eng. 13, No. 2, 148-156 (2001).
117
Finite-state computation in analog neural networks: steps towards biologically plausible models? (English)
Emergent Neural Computational Architectures Based on Neuroscience, 480-493 (2001).
118
Fuzzy constraints using the enhanced entity-relationship model (English)
SCCC, 86-94 (2001).
119
Using artificial neural network to define fuzzy comparators in FSQL with the criterion of some decision-maker (English)
IWANN (2), 587-594 (2001).
120
Result 101 to 120 of 150 total
Start
Contact
Print
General Help
