From post

From codeswitching via language mixing to fused lects: Toward a dynamic topology of bilingual speech

. International Journal of Bilingualism, 3 (4): 309-332 (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Workshop summary: On-line learning with limited feedback., , , , , и . ICML, том 382 из ACM International Conference Proceeding Series, стр. 8. ACM, (2009)On-Line Learning of Rectangles in Noisy Environments.. COLT, стр. 253-261. ACM, (1993)Learning of Depth Two Neural Networks with Constant Fan-In at the Hidden Nodes (Extended Abstract)., , , и . COLT, стр. 333-343. ACM, (1996)Strategien der Arbeitsbeschaffung in 3 Ländern: antizyklische, problemgruppen-orientierte u. experimentelle Arbeitsbeschaffungsmaßnahmen. Discussion papers / Internationales Institut für Management und Verwaltung. Arbeitsmarktpolitik Wissenschaftszentrum, Berlin, (1983)Pareto Front Identification from Stochastic Bandit Feedback., , , и . AISTATS, том 51 из JMLR Workshop and Conference Proceedings, стр. 939-947. JMLR.org, (2016)Upper-Confidence-Bound Algorithms for Active Learning in Multi-armed Bandits., , , , и . ALT, том 6925 из Lecture Notes in Computer Science, стр. 189-203. Springer, (2011)Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information., , , , , , и . COLT, том 99 из Proceedings of Machine Learning Research, стр. 159-163. PMLR, (2019)The InfoSky visual explorer: exploiting hierarchical structure and document similarities., , , , , , , , и . Inf. Vis., 1 (3-4): 166-181 (2002)Approximating Hyper-Rectangles: Learning and Pseudorandom Sets., , и . J. Comput. Syst. Sci., 57 (3): 376-388 (1998)Logarithmic Online Regret Bounds for Undiscounted Reinforcement Learning., и . NIPS, стр. 49-56. MIT Press, (2006)