A survey of machine learning approaches for student dropout prediction in online courses

B Prenkaj, P Velardi, G Stilo, D Distante… - ACM Computing Surveys …, 2020 - dl.acm.org
The recent diffusion of online education (both MOOCs and e-courses) has led to an
increased economic and scientific interest in e-learning environments. As widely …

Time-dependent graphs: Definitions, applications, and algorithms

Y Wang, Y Yuan, Y Ma, G Wang - Data Science and Engineering, 2019 - Springer
A time-dependent graph is, informally speaking, a graph structure dynamically changes with
time. In such graphs, the weights associated with edges dynamically change over time, that …

The capacity and robustness trade-off: Revisiting the channel independent strategy for multivariate time series forecasting

L Han, HJ Ye, DC Zhan - IEEE Transactions on Knowledge …, 2024 - ieeexplore.ieee.org
Multivariate time series data comprises various channels of variables. The multivariate
forecasting models need to capture the relationship between the channels to accurately …

Finding temporal paths under waiting time constraints

A Casteigts, AS Himmel, H Molter, P Zschoche - Algorithmica, 2021 - Springer
Computing a (short) path between two vertices is one of the most fundamental primitives in
graph algorithmics. In recent years, the study of paths in temporal graphs, that is, graphs …

Low-latency graph streaming using compressed purely-functional trees

L Dhulipala, GE Blelloch, J Shun - Proceedings of the 40th ACM …, 2019 - dl.acm.org
There has been a growing interest in the graph-streaming setting where a continuous
stream of graph updates is mixed with graph queries. In principle, purely-functional trees are …

On temporal graph exploration

T Erlebach, M Hoffmann, F Kammer - Journal of Computer and System …, 2021 - Elsevier
The temporal graph exploration problem TEXP is the problem of computing a foremost
exploration schedule for a temporal graph, ie, a temporal walk that starts at a given start …

[HTML][HTML] The complexity of finding small separators in temporal graphs

P Zschoche, T Fluschnik, H Molter… - Journal of Computer and …, 2020 - Elsevier
Temporal graphs have time-stamped edges. Building on previous work, we study the
problem of finding a small vertex set (the separator) whose removal destroys all temporal …

Elements of the theory of dynamic networks

O Michail, PG Spirakis - Communications of the ACM, 2018 - dl.acm.org
Elements of the theory of dynamic networks Page 1 72 COMMUNICATIONS OF THE ACM |
FEBRUARY 2018 | VOL. 61 | NO. 2 review articles IMA GE B Y ANITHA DEVI MUR THI A …

Moma: Multi-object multi-actor activity parsing

Z Luo, W Xie, S Kapoor, Y Liang… - Advances in neural …, 2021 - proceedings.neurips.cc
Complex activities often involve multiple humans utilizing different objects to complete
actions (eg, in healthcare settings, physicians, nurses, and patients interact with each other …

[HTML][HTML] Temporal graph classes: A view through temporal separators

T Fluschnik, H Molter, R Niedermeier, M Renken… - Theoretical Computer …, 2020 - Elsevier
We investigate for temporal graphs the computational complexity of separating two distinct
vertices s and z by vertex deletion. In a temporal graph, the vertex set is fixed but the edges …