We present a detailed study of network evolution by analyzing four large online social networks with full temporal information about node and edge arrivals. For the first time at ...
Jure Leskovec, Lars Backstrom, Ravi Kumar, Andrew ...
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
Juanjuan Yu, Yue He, Kai Wu, Marco Tacca, Andrea F...
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
Aiming at detecting secret information hidden in a given image using steganographic tools, steganalysis has been of interest since the end of 1990’s. In particular, universal ste...