G
Gyorgy Dan
Researcher at Royal Institute of Technology
Publications - 175
Citations - 3643
Gyorgy Dan is an academic researcher from Royal Institute of Technology. The author has contributed to research in topics: Cache & Computer science. The author has an hindex of 29, co-authored 158 publications receiving 3007 citations. Previous affiliations of Gyorgy Dan include Instituto Superior Técnico & Middle East Technical University.
Papers
More filters
Proceedings ArticleDOI
Minimizing age of correlated information for wireless camera networks
TL;DR: The multi-view age minimization problem (MVAM) is formulated and it is proved that it is NP-hard and fundamental results including tractable cases and optimality conditions are provided.
Journal ArticleDOI
Resilience in live peer-to-peer streaming [Peer-to-Peer Multimedia Streaming]
Viktoria Fodor,Gyorgy Dan +1 more
TL;DR: A survey of the media distribution methods, overlay structures, and error-control solutions proposed for peer-to-peer live streaming argues that efficient architectures can be defined only through thorough performance analysis.
Proceedings ArticleDOI
Dynamic content allocation for cloud-assisted service of periodic workloads
Gyorgy Dan,Niklas Carlsson +1 more
TL;DR: This paper provides an exact solution to the discrete time decision problem in the form of a mixed integer linear programming problem, proposes computationally feasible approximations, and gives bounds on their approximation ratios.
Journal ArticleDOI
A Meta-Learning Scheme for Adaptive Short-Term Network Traffic Prediction
TL;DR: This work treats the prediction problem for non-stationary traffic in an adversarial context, and proposes a meta-learning scheme that consists of a set of predictors, each optimized to predict a particular kind of traffic, and of a master policy that is trained for choosing the best fit predictor dynamically based on recent prediction performance, using deep reinforcement learning.
Journal ArticleDOI
Undetectable Timing-Attack on Linear State-Estimation by Using Rank-1 Approximation
TL;DR: It is shown that it is possible to forge delay attacks that are undetectable, and classic bad-data detection techniques such as the largest normalized residual and the £2 -test are used to prove undetectability.