Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Milos Kravcik

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Nghia Duong-Trung

> Home > Persons > Milos Kravcik

Publications

2023
[c50]
- view
  - electronic edition @ ceur-ws.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/ectel/KotteKD23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ectel/KotteKD23
Hitesh Kotte, Milos Kravcík, Nghia Duong-Trung:
Real-Time Posture Correction in Gym Exercises: A Computer Vision-Based Approach for Performance Analysis, Error Classification and Feedback. MILeS@EC-TEL 2023: 64-70
[c49]
- view
  authority control:
- export record
  dblp key:
  - conf/ectel/DuongTrungKK23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ectel/DuongTrungKK23
Nghia Duong-Trung, Hitesh Kotte, Milos Kravcík:
Augmented Intelligence in Tutoring Systems: A Case Study in Real-Time Pose Tracking to Enhance the Self-learning of Fitness Exercises. EC-TEL 2023: 705-710
[c48]
- view
  authority control:
- export record
  dblp key:
  - conf/its/OrsoniPDBKG23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/its/OrsoniPDBKG23
Matteo Orsoni, Alexander Pögelt, Nghia Duong-Trung, Mariagrazia Benassi, Milos Kravcik, Martin Grüttmüller:
Recommending Mathematical Tasks Based on Reinforcement Learning and Item Response Theory. ITS 2023: 16-28

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.