Nodlink: An online system for fine-grained apt attack detection and investigation
Advanced Persistent Threats (APT) attacks have plagued modern enterprises, causing
significant financial losses. To counter these attacks, researchers propose techniques that …
significant financial losses. To counter these attacks, researchers propose techniques that …
Architecture design of the Internet of Things based on cloud computing
J Rui, S Danpeng - 2015 seventh international conference on …, 2015 - ieeexplore.ieee.org
Importance and development advantage of the Internet of Things industry chain is
discussed. The basic ideas and methods of the combination of cloud computing and the …
discussed. The basic ideas and methods of the combination of cloud computing and the …
One tree to rule them all: Poly-logarithmic universal steiner tree
A spanning tree T of graph G is a ρ-approximate universal Steiner tree (UST) for root vertex r
if, for any subset of vertices S containing r, the cost of the minimal subgraph of T connecting …
if, for any subset of vertices S containing r, the cost of the minimal subgraph of T connecting …
Chasing positive bodies
We study the problem of chasing positive bodies in 1: given a sequence of bodies
K_t=\left{x^t∈R_+^n∣C^tx^t≧1,P^tx^t≦1\right\} revealed online, where C^t and P^t are …
K_t=\left{x^t∈R_+^n∣C^tx^t≧1,P^tx^t≦1\right\} revealed online, where C^t and P^t are …
Tree embeddings for hop-constrained network design
Network design problems aim to compute low-cost structures such as routes, trees and
subgraphs. Often, it is natural and desirable to require that these structures have small hop …
subgraphs. Often, it is natural and desirable to require that these structures have small hop …
Beyond tree embeddings–a deterministic framework for network design with deadlines or delay
We consider network design problems with deadline or delay. All previous results for these
models are based on randomized embedding of the graph into a tree (HST) and then …
models are based on randomized embedding of the graph into a tree (HST) and then …
Nearly-tight lower bounds for set cover and network design with deadlines/delay
N Touitou - 32nd International Symposium on Algorithms and …, 2021 - drops.dagstuhl.de
In network design problems with deadlines/delay, an algorithm must make transmissions
over time to satisfy connectivity requests on a graph. To satisfy a request, a transmission …
over time to satisfy connectivity requests on a graph. To satisfy a request, a transmission …
Online spanners in metric spaces
Given a metric space, a weighted graph over is a metric-spanner of if for every,, where is the
shortest path metric in. In this paper, we construct spanners for finite sets in metric spaces in …
shortest path metric in. In this paper, we construct spanners for finite sets in metric spaces in …
The online min-sum set cover problem
D Fotakis, L Kavouras, G Koumoutsos… - arXiv preprint arXiv …, 2020 - arxiv.org
We consider the online Min-Sum Set Cover (MSSC), a natural and intriguing generalization
of the classical list update problem. In Online MSSC, the algorithm maintains a permutation …
of the classical list update problem. In Online MSSC, the algorithm maintains a permutation …
Pick, pack, & survive: charging robots in a modern warehouse based on online connected dominating sets
H Hamann, C Markarian… - … Conference on Fun …, 2018 - drops.dagstuhl.de
The modern warehouse is partially automated by robots. Instead of letting human workers
walk into shelfs and pick up the required stock, big groups of autonomous mobile robots …
walk into shelfs and pick up the required stock, big groups of autonomous mobile robots …