Results 21 to 30 of about 2,534,689 (298)
On evaluating stream learning algorithms [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
João Gama 0001 +2 more
openaire +2 more sources
A second look at counting triangles in graph streams [PDF]
In this paper we present improved results on the problem of counting triangles in edge streamed graphs. For graphs with m edges and at least T triangles, we show that an extra look over the stream yields a two-pass streaming algorithm that uses O((m)/(ε4.
Jowhari, Hossein, Cormode, Graham
core +1 more source
The shielding calculation of neutron streaming problems with ducts is characterized by the strong anisotropy of angular flux, which poses a challenge for the analysis of nuclear installations.
Xinyu Wang +3 more
doaj +1 more source
Improving the fault resilience of overlay multicast for media streaming [PDF]
A key technical challenge for overlay multicast is that the highly dynamic multicast members can make data delivery unreliable. In this paper, we address this issue in the context of live media streaming by exploring 1) how to construct a stable ...
Tan, Guang +2 more
core +1 more source
A Cloud-Based Parallel Space-Saving Algorithm for Big Networking Data
As the network continues to evolve, completely analyzing the traffic requires immeasurable resources. In situations of processing enormous streaming data, the most significant k items (Top-k) are more interesting, and some streaming algorithms are ...
Dazhong He, Yang Yang, Jun Liu
doaj +1 more source
Streaming algorithms for estimating entropy [PDF]
We give a method for estimating the empirical Shannon entropy of a distribution in the streaming model of computation. Our approach reduces this problem to the well-studied problem of estimating frequency moments. The analysis of our approach is based on new results which establish quantitative bounds on the rate of convergence of Renyi entropy towards
Nicholas J. A. Harvey +2 more
openaire +2 more sources
Address Block Counting Using Two-Tier Cardinality Estimation
An address block is defined as a set of continuous addresses between two points in an address space. Counting the number of distinct address blocks that have been accessed during a measurement period can provide useful information for cyber security ...
Myungkeun Yoon, Young Jae Kim
doaj +1 more source
Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $\Delta$-Coloring [PDF]
Every graph with maximum degree $\Delta$ can be colored with $(\Delta+1)$ colors using a simple greedy algorithm. Remarkably, recent work has shown that one can find such a coloring even in the semi-streaming model.
Sepehr Assadi +2 more
doaj +1 more source
A Framework for Adversarially Robust Streaming Algorithms [PDF]
We investigate the adversarial robustness of streaming algorithms. In this context, an algorithm is considered robust if its performance guarantees hold even if the stream is chosen adaptively by an adversary that observes the outputs of the algorithm along the stream and can react in an online manner.
Omri Ben-Eliezer +3 more
openaire +6 more sources
Hybrid Peer-to-peer Streaming System for Mobile Peers with Transcoding
In this paper, we study in hybrid peer-to-peer (P2P) streaming system, which includes fixed peers and mobile peers in the same network, and propose a flow rate allocation algorithm to optimize the streaming system.
Shuai Zeng, Guo-feng Zhao, Chuan Xu
doaj +1 more source

