Thesis - Master (10)

221.
Thesis - Master
Abdel Khaliq, L. H.: Multi-Task Learning using Transformer. Master, 55 pp., Universität des Saarlandes, Saarbrücken (2023)
222.
Thesis - Master
Ahmed, N.: UniCon: Boosting Few-Shot Class Incremental Learning through Uniform Target Space and Contrastive Learning. Master, 56 pp., Universität des Saarlandes, Saarbrücken (2023)
223.
Thesis - Master
Ali, M.: A Data-driven Analysis of Self-harm Discussions on Incel Web Communities. Master, X, 57 pp., Universität des Saalandes, Saarbrücken (2023)
224.
Thesis - Master
Anwari, A. S.: Learning Filters to Improve Social Media Search. Master, XI, 69 pp., Universität des Saarlandes, Saarbrücken (2023)
225.
Thesis - Master
Bashir, A.: Leveraging Self-Supervised Learning in Domain-Specific Language Models. Master, XI, 54 pp., Universität des Saarlandes, Saarbrücken (2023)
226.
Thesis - Master
Danalachi, L.: Incremental Domain Adaptation for Semantic Segmentation. Master, 67 pp., Universität des Saarlandes, Saarbrücken (2023)
227.
Thesis - Master
Hennen, P.: On the Inference of Local Preferences. Master, IX, 45 pp., Universität des Saarlandes, Saarbrücken (2023)
228.
Thesis - Master
Jadon, A.: Semantic Road Scene Understanding with Realistic Synthetic Data. Master, 115 pp., Universität des Saarlandes, Saarbrücken (2023)
229.
Thesis - Master
Kelkar, N.: Towards Real-time Neural Point Representations. Master, 74 pp., Universität des Saarlandes, Saarbrücken (2023)
230.
Thesis - Master
Ul Haque, T.: Data Driven Analysis of Facebook Data Focusing Sinophobia and Antisemitism. Master, VI, 65 pp., Universität des Saalandes, Saarbrücken (2023)

Thesis - Bachelor (1)

231.
Thesis - Bachelor
Gabelmann, J.: Few-Shot Learning with the Help of Self-Supervision. Bachelor, V, 30 pp., Universität des Saarlandes, Saarbrücken (2023)

Working Paper (27)

232.
Working Paper
Akrami, H.; Garg, J.: Breaking the 3/4 Barrier for Approximate Maximin Share. (2023), 32 pp.
233.
Working Paper
Akrami, H.; Garg, J.; Sharma, E.; Taki, S.: Improving Approximation Guarantees for Maximin Share. (2023), 41 pp.
234.
Working Paper
Arnaout, H.; Razniewski, S.: Can Large Language Models Generate Salient Negative Statements? (2023), 7 pp.
235.
Working Paper
Ashvinkumar, V.; Bernstein, A.; Cao, N.; Grunau, C.; Haeupler, B.; Jiang, Y.; Nanongkai, D.; Su, H. H.: Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights. (2023), 38 pp.
236.
Working Paper
Baumann, P.; Meyer, R.; Zetzsche, G.: Regular Separability in Büchi VASS. (2023), 31 pp.
237.
Working Paper
Bernstein, A.; Nanongkai, D.; Wulff-Nilsen, C.: Negative-Weight Single-Source Shortest Paths in Near-linear Time. (2023), 38 pp.
238.
Working Paper
Bhattacharya, S.; Kiss, P.; Saranurak, T.: Dynamic (1.5+Epsilon)-Approximate Matching Size in Truly Sublinear Update Time. (2023), 42 pp.
239.
Working Paper
Blikstad, J.; Kiss, P.: Incremental (1 - ε)-approximate dynamic matching in O(poly(1/ε)) update time. (2023), 19 pp.
240.
Working Paper
Bromberger, M.; Leutgeb, L.; Weidenbach, C.: Explicit Model Construction for Saturated Constrained Horn Clauses. (2023), 22 pp.
Go to Editor View